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.

169,291 papers · 148 categories

Trend · papers per month

336699132 · May 202619922001200920182026
48 results for face alignment

Compact binary CNNs improve landmark localization on limited resources.

problem Designing lightweight architectures for landmark localization with limited resources.
method Binarization of neural networks, hierarchical, parallel, multi-scale residual architecture.
result Significant performance improvement over standard architectures.

Synthesizes faces from facial features, invariant to pose and expression.

problem Creating realistic face images from facial features.
method Learning facial landmarks and textures from facial-recognition features, training on frontal, neutral-expression images.
result Generated images are invariant to lighting, pose, and expression.

A new method reduces preference distortion in LLM alignment.

problem Vulnerability of traditional LLM alignment methods to human preference heterogeneity.
method Sign Estimator: A simple, provably consistent, and efficient estimator using binary classification loss.
result Substantially reduces preference distortion over a panel of simulated personas.

New framework formalizes RLHF trilemma: improving safety, fairness, and robustness is computationally infeasible.

problem Aligning large language models with diverse human values while maintaining computational feasibility and robustness.
method Complexity-theoretic analysis integrating statistical learning theory and robust optimization.
result Achieving both representativeness (epsilon <= 0.01) and robustness (delta <= 0.001) for global-scale populations requires super-polynomial operations.

Robust high-dimensional data processing has witnessed an exciting development in recent years, as theoretical results have shown that it is possible using convex programming to optimize data fit to a low-rank component plus a sparse outlier component. This problem is also known as Robust PCA, and it has found applicati…

2013-06-03abs ↗pdf ↗

ELS framework improves safety alignment by dynamically steering LLMs towards helpful responses.

problem Over-Refusal in Aligned Large Language Models
method Fine-tuning free framework using an Energy-Based Model (EBM) to dynamically steer LLMs during inference.
result Extensive experiments show a significant reduction in false refusals (from 57.3% to 82.6%) while maintaining safety performance.

PAC-Bayesian theory improves text-to-image models by enforcing alignment and generalization.

problem Text-to-image models struggle with complex prompts, misaligning modifiers and neglecting certain elements.
method Proposes a Bayesian approach with custom priors over attention distributions to enforce desirable properties.
result Achieves state-of-the-art results across multiple metrics on standard benchmarks.

New algorithm improves inference-time alignment without reward hacking.

problem Improving quality of responses from language models with limited compute.
method Inference-time alignment, focusing on extttInferenceTimePessimism exttt{InferenceTimePessimism} algorithm.
result Optimal performance and scaling-monotonicity of extttInferenceTimePessimism exttt{InferenceTimePessimism}.

A3RL combines online and offline RL with active sampling to improve policy learning.

problem Combining online and offline RL for sample efficiency and robustness.
method A3RL uses a confidence-aware Active Advantage Aligned (A3) sampling strategy to prioritize data from both online and offline sources.
result A3RL outperforms competing online RL techniques that use offline data.

Unified framework for efficient online training of RNNs.

problem Efficient and biologically plausible online training of recurrent neural networks.
method Organizes algorithms based on criteria like past vs. future facing, tensor structure, stochastic vs. deterministic, and closed form vs. numerical.
result Algorithms cluster according to criteria, revealing conceptual connections.

DET unifies geometric and functional alignment for high-dimensional scientific data.

problem Challenges in nonrigid registration for high-dimensional, irregular data.
method Domain Elastic Transform (DET) treats data as functions on irregular domains, using a Bayesian framework for elastic motion registration.
result DET achieves 92% topological preservation on MERFISH data and successfully registers whole-embryo Stereo-seq atlases.

Study shows GDP and CPI predict CCC funding, highlighting need for economic forecasting.

problem Challenges in aligning CCC funding with DEI initiatives.
method Quantitative correlational design, analyzing 30 years of economic data.
result Strong positive correlation between GDP growth and CCC funding levels, and between CPI and funding levels.

A new deep generative model captures global dependencies without supervision.

problem Global modeling in deep generative models.
method Non-i.i.d. variational autoencoders with mixture model and global Gaussian latent variable.
result Captures interpretable disentangled representations and domain alignment.

Enhances monitoring of industrial systems with limited data.

problem Early detection of rare faults in safety-critical systems with limited training data.
method Feature alignment techniques (variational encoder, adversarial training) to align features from different units.
result Feature alignment improves robustness of one-class classifier for health monitoring.

Study assesses linear classifiers for virus genotyping and subtyping.

problem Challenges in classifying viral sequences, especially in alignment-free methods.
method Comprehensive evaluation of linear classifiers on HCV genomes, varying parameters and sequence lengths.
result Several classifiers perform well under specific conditions, providing robust assessment.

The paper studies and mitigates accuracy disparity in regression models.

problem Accuracy disparity between different demographic subgroups in high-stakes domains.
method Error decomposition theorem and distribution alignment algorithm.
result The proposed algorithm effectively mitigates accuracy disparity while maintaining predictive power.

Federated learning framework improves model generalization and privacy.

problem Communication overhead and statistical heterogeneity in FL.
method Prototypes and lightweight adapters for local model refinement.
result Improves classification accuracy over baseline algorithms.

The paper characterizes functions of shallow ReLU NN denoisers under minimal norm constraints.

problem Understanding the theoretical success of neural network denoisers.
method Characterization of functions realized by shallow ReLU NN denoisers under minimal norm constraints.
result The functions realized by shallow ReLU NN denoisers are contractive toward clean data points and generalize better than the empirical MMSE estimator at low noise levels.

Proposes auditing for envy-freeness in recommender systems to assess individual preferences.

problem Auditing fairness in recommender systems for individual preferences.
method Formulates a pure exploration problem in multi-armed bandits, proposing a sample-efficient algorithm with theoretical guarantees.
result Algorithm ensures fairness without deteriorating user experience on real-world datasets.

GARIM theory explains how conscious manipulation of internal representations enhances goal-directed behavior.

problem Limited understanding of how consciousness supports flexible goal-directed cognition.
method Extending a three-component theory of flexible cognition, proposing GARIM theory.
result Conscious states actively manipulate internal representations to align with goals, enhancing flexibility.

GRAM addresses healthcare data insufficiency and interpretation challenges using graph-based attention.

problem Data insufficiency and lack of interpretability in healthcare predictive modeling.
method GRAM integrates EHR with medical ontologies, using attention mechanisms to represent medical concepts.
result GRAM outperforms RNN in accuracy and interpretability, using less data.

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.

Collectives can manipulate learning platforms by coordinated data submission, requiring strategic assessments and algorithms.

problem Collectives can influence learning platforms by altering data, posing risks and requiring strategic planning.
method Developed a theoretical and algorithmic framework to understand and mitigate collective manipulation of learning platforms.
result Demonstrated the need for strategic assessments and implementable coordination algorithms to prevent collective manipulation.

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.

SpecRaGE learns robust multi-view representations using graph Laplacians and neural networks.

problem Challenges in generalizing and scaling multi-view representation learning methods.
method SpecRaGE integrates graph Laplacian methods with neural networks to learn robust representations.
result SpecRaGE outperforms state-of-the-art methods in noisy and contaminated data scenarios.

Inference-aware meta-alignment of LLMs reduces computational cost.

problem Aligning LLMs to diverse human preferences is challenging due to conflicting criteria.
method IAMA trains a base model to be aligned to multiple tasks via different inference-time alignment algorithms, using non-linear GRPO for optimization.
result IAMA enables effective alignment of LLMs to multiple criteria with limited computational budget.

Conformal Alignment ensures trustworthy outputs from foundation models.

problem Ensuring outputs from foundation models align with human values in high-stakes tasks.
method A framework that trains an alignment predictor using reference data to select trustworthy outputs.
result Conformal Alignment accurately identifies trustworthy outputs via lightweight training over moderate reference data.

LPL optimizes embeddings to align local neighborhoods, improving cross-lingual word alignment.

problem Aligning embeddings across different datasets and languages.
method Locality Preserving Loss (LPL) optimizes model to project embeddings while maintaining local neighborhoods and aligning them.
result LPL-based alignment leads to better and consistent accuracy, especially in small training set settings.

Extends reinforcement learning alignment to scalar rewards, improving math reasoning.

problem Designing reinforcement learning algorithms for general LLM alignment.
method Introduces f-GRPO and f-HAL, estimating f-divergences between reward-aligned and unaligned distributions.
result Improves math reasoning RLVR tasks and mitigates reward hacking.

DKN uses knowledge graphs to improve news recommendation.

problem Limited personalized news recommendations due to lack of external knowledge.
method Integrates knowledge graph representation into news recommendation using a deep knowledge-aware network (DKN).
result DKN achieves substantial gains over state-of-the-art models in click-through rate prediction.

Unified model for age-invariant face recognition with photorealistic face synthesis.

problem Reliable face recognition across ages remains challenging due to significant intra-class variations.
method Unified deep architecture for cross-age face synthesis and recognition, continuous face rejuvenation/aging, disentangled age-invariant face representations.
result Superior performance on CAFR and other cross-age datasets, promising generalizability to unconstrained face recognition.

Universal adversarial patches prevent face detection in various frameworks.

problem Preventing face detection in state-of-the-art face detection systems.
method Investigated the phenomenon of patches that suppress face detection and proposed optimization-based approaches for automatic design.
result Universal adversarial patches can prevent face detection without introducing false positives.