Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

4997146194 · Jun 202019922001200920172026
48 results for critical faces

Study on critical faces convergence in a Poisson point process.

problem Convergence of point processes associated with critical faces in a Čech filtration.
method Established convergence in M0\mathcal M_0-topology for critical faces above vanishing threshold.
result Obtained limit theorems for positive and negative critical faces.

Discrete Morse functions induce shellings with critical tiles corresponding to function's critical faces.

problem Mapping discrete Morse functions to shellings for topological analysis.
method Inducing Morse shellings on the second barycentric subdivision of a simplicial complex.
result Critical tiles of induced shellings correspond to critical faces of the discrete Morse function.

Shellable tilings on simplicial complexes help understand their structure.

problem Understanding the structure of simplicial complexes through tilings.
method Proving the existence of shellable h-tilings on finite simplicial complexes after stellar subdivisions.
result The h-vector of a tiling is determined by the critical vector, with palindromic properties for closed triangulated manifolds.

The state-of-the-art performance of deep learning algorithms has led to a considerable increase in the utilization of machine learning in security-sensitive and critical applications. However, it has recently been shown that a small and carefully crafted perturbation in the input space can completely fool a deep model.…

2018-09-24abs ↗pdf ↗

Powerful generative adversarial networks (GAN) have been developed to automatically synthesize realistic images from text. However, most existing tasks are limited to generating simple images such as flowers from captions. In this work, we extend this problem to the less addressed domain of face generation from fine-gr…

2019-11-26abs ↗pdf ↗

Detect facial keypoints is a critical element in face recognition. However, there is difficulty to catch keypoints on the face due to complex influences from original images, and there is no guidance to suitable algorithms. In this paper, we study different algorithms that can be applied to locate keyponits. Specifical…

2017-10-15abs ↗pdf ↗

Paper improves AIRL by enhancing policy imitation and addressing reward recovery issues.

problem Inadequate policy imitation and limited transferable reward recovery in AIRL.
method Substituted built-in algorithm with SAC for policy updating and proposed PPO-AIRL + SAC hybrid framework.
result SAC improves policy imitation but hinders reward recovery; PPO-AIRL + SAC achieves satisfactory transfer effect.

In bounding the homology of a manifold, Forman's Discrete Morse theory recovers the full precision of classical Morse theory: Given a PL triangulation of a manifold that admits a Morse function with c_i critical points of index i, we show that some subdivision of the triangulation admits a boundary-critical discrete Mo…

2010-10-04abs ↗pdf ↗

The tremendous success of deep learning for imaging applications has resulted in numerous beneficial advances. Unfortunately, this success has also been a catalyst for malicious uses such as photo-realistic face swapping of parties without consent. Transferring one person's face from a source image to a target image of…

2019-09-10abs ↗pdf ↗

This paper reviews methods for constructing confidence intervals for error rates in 1:1 matching tasks.

problem Challenges in assessing uncertainty of error rates in matching algorithms, especially when data are dependent and error rates are low.
method Derives and examines statistical properties of methods for constructing confidence intervals for error rates in 1:1 matching tasks.
result Coverage and interval width vary with sample size, error rates, and data dependence.

Actor-critic methods, a type of model-free Reinforcement Learning, have been successfully applied to challenging tasks in continuous control, often achieving state-of-the art performance. However, wide-scale adoption of these methods in real-world domains is made difficult by their poor sample efficiency. We address th…

2019-10-28abs ↗pdf ↗

We study Cohen-Macaulay actions, a class of torus actions on manifolds, possibly without fixed points, which generalizes and has analogous properties as equivariantly formal actions. Their equivariant cohomology algebras are computable in the sense that a Chang-Skjelbred Lemma, and its stronger version, the exactness o…

2009-12-03abs ↗pdf ↗

This study analyzes bias in face generation models and proposes mitigation techniques.

problem Bias in face generation models that may misrepresent certain social groups.
method Three approaches: generators, attribute modifier, and post-processing bias mitigators.
result Generators suffer from bias across all social groups, while post-processing mitigators show different feature concentration.

Deep-PrAE improves rare-event simulation for black-box systems.

problem Evaluating rare safety-critical events in learning-based systems.
method Combines deep neural networks with IS to create statistically guaranteed estimations.
result Deep-PrAE provides accurate bounds on safety-critical event probabilities.

New pricing algorithm learns demand curves and optimizes prices in dynamic markets.

problem Dynamic pricing in markets with incomplete demand information and shifting conditions.
method Actor-Critic Information-Directed Pricing (ACIDP) using IDS algorithms and auditing procedures.
result ACIDP outperforms UCB and TS in market environment shifts.

Optimizes master faces for 2D and 3D face verification using evolutionary algorithms and neural networks.

problem Impersonation attacks using master faces for face-based identity authentication.
method Evolutionary algorithm in latent space of StyleGAN, neural network to direct search, 2D and 3D face reconstruction.
result Obtains high impersonation rates with fewer master faces for 2D and 3D face verification.

Differential privacy (DP) is a popular mechanism for training machine learning models with bounded leakage about the presence of specific points in the training data. The cost of differential privacy is a reduction in the model's accuracy. We demonstrate that in the neural networks trained using differentially private …

2019-05-28abs ↗pdf ↗

Face recognition systems are vulnerable to composite face reconstruction attacks.

problem Vulnerability of face recognition systems to composite face reconstruction attacks.
method Assumed attacker uses composite face parts to reconstruct faces faster and more efficiently.
result Current face recognition systems are extremely vulnerable to random search attacks.

Humans are able to imagine a person's voice from the person's appearance and imagine the person's appearance from his/her voice. In this paper, we make the first attempt to develop a method that can convert speech into a voice that matches an input face image and generate a face image that matches the voice of the inpu…

2019-04-09abs ↗pdf ↗

In this paper, we study face vectors of simplicial posets that are the face posets of cell decompositions of topological manifolds without boundary. We characterize all possible face vectors of simplicial posets whose geometric realizations are homeomorphic to the product of spheres. As a corollary, we obtain the chara…

2010-10-02abs ↗pdf ↗

We are interested in attribute-guided face generation: given a low-res face input image, an attribute vector that can be extracted from a high-res image (attribute image), our new method generates a high-res face image for the low-res input that satisfies the given attributes. To address this problem, we condition the …

2017-05-28abs ↗pdf ↗

Spatially-aware model improves earthquake hazard assessment accuracy.

problem Misrepresentation of seismic effects across diverse landscapes.
method Causal Bayesian network with Gaussian Processes and normalizing flows.
result Achieves up to 35.2% AUC improvement over existing methods.

Bayesian optimization generates personalized face stimuli for cognitive neuroscience.

problem Lack of personalized face stimuli in cognitive neuroscience studies.
method Combines GANs with Bayesian optimization to identify individual response patterns to faces.
result Algorithm efficiently generates optimal faces maximizing individual subject's response.

The paper analyzes optimal timing for converting wealth into annuities in the presence of a mortality shock.

problem Optimal timing for converting retirement wealth into annuities under a mortality risk.
method Derives explicit closed-form solutions for value function and optimal stopping boundaries.
result The optimal strategy depends on the interplay between annuity attractiveness, investment returns, and bequest motives.

The paper is motivated by the study of graded representations of Takiff algebras, cominuscule parabolics, and their generalizations. We study certain special subsets of the set of weights (and of their convex hull) of the generalized Verma modules (or GVM's) of a semisimple Lie algebra $\lie g$. In particular, we exten…

2010-05-07abs ↗pdf ↗

Enhances parallelism in decentralized learning for larger networks.

problem Scalability limitations in decentralized learning with increasing number of machines.
method Proposes Decentralized Anytime SGD, a novel algorithm that extends parallelism threshold.
result Establishes a theoretical upper bound on parallelism surpassing current state-of-the-art.

Face recall is a basic human cognitive process performed routinely, e.g., when meeting someone and determining if we have met that person before. Assisting a subject during face recall by suggesting candidate faces can be challenging. One of the reasons is that the search space - the face space - is quite large and lac…

2016-04-28abs ↗pdf ↗

New flows represent Thurston norm ball faces, differing by veering mutations.

problem Dynamic representation of Thurston norm ball faces by distinct flows.
method Combining veering triangulations and mutations to represent faces by multiple flows.
result Non-fibered faces can be represented by two distinct flows differing by veering mutations.

Study finds non-monotonic Value of Information in dynamic multi-market monopoly.

problem Investigates non-monotonicity in Value of Information for a price-setting monopolist.
method Uses a Bayesian inverse problem with Kalman-Bucy-Stratonovich filter in a dynamic discrete model.
result Non-monotonic relationship between signal variance and Value of Information.

In this paper we address the following question, given a face representation, how many identities can it resolve? In other words, what is the capacity of the face representation? A scientific basis for estimating the capacity of a given face representation will not only benefit the evaluation and comparison of differen…

2017-09-29abs ↗pdf ↗

Enhances 2D face recognition with 3D features using active illumination.

problem Improving robustness of 2D face recognition to spoofing attacks and low-light conditions.
method Projecting a high spatial frequency pattern onto the face to recover 3D information and a 2D image simultaneously.
result Significantly boosts face recognition performance and dramatically improves robustness to spoofing attacks.

Paper proposes a method to encrypt faces while maintaining visual similarity.

problem Protecting personal data from unauthorized face recognition.
method Targeted identity-protection iterative method (TIP-IM) to generate adversarial identity masks.
result TIP-IM provides 95%+ protection success rate against face recognition models.

Study evaluates the impact of academic support center's face-to-face assistance on student performance.

problem Underestimation of Academic Support Center's true impact due to group bias.
method Applied causal inference theory and T-learner to evaluate conditional average treatment effect (CATE) of F2F personal assistance.
result Developed a new CATE function that depends on the number of F2F sessions, predicting improved CATE performance.

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the co…

2003-07-30abs ↗pdf ↗