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,051 papers · 148 categories

Trend · papers per month

3166329471,263 · Jun 202019922001200920182026
48 results for generalization accuracy

New methods show robustness and accuracy can coexist.

problem Inevitability of robustness-accuracy tradeoff in deep learning.
method Prove robustness and accuracy achievable through locally Lipschitz functions; explore combining dropout with robust training methods.
result Achieving robustness and accuracy requires methods imposing local Lipschitzness and deep learning generalization techniques.

Paper explores tradeoff between standard and robust accuracy for latent models.

problem Tradeoff between standard accuracy and robust accuracy in adversarial training.
method Revisits adversarial training for latent models, considering Gaussian mixture and generalized linear models.
result Low-dimensional manifold structure mitigates the tradeoff between standard and robust accuracy.

Adversarial training can degrade standard accuracy even when optimal for robust accuracy.

problem Tradeoff between standard and robust accuracy in adversarial training.
method Analyzes adversarial training's impact on standard accuracy, even when optimal for robust accuracy.
result Even with optimal predictors, adversarial training can still degrade standard accuracy.

Paper introduces Influence Function to assess OOD generalization stability.

problem Assessing OOD generalization accuracy when target domains are unknown.
method Introduced Influence Function from robust statistics to monitor model stability.
result Accuracy on test domains and Influence Function variance can distinguish OOD algorithms and generalization quality.

The paper analyzes adversarial training effects on classification accuracy.

problem Understanding adversarial training's impact on standard and robust accuracy.
method Derived precise statistical analysis for binary classification problems with Gaussian data.
result Theoretical explanation of standard and robust accuracy trends for adversarial training.

AFLAC improves domain generalization by balancing invariance and accuracy.

problem Balancing domain invariance and classification accuracy for domain generalization.
method Adversarial feature learning with accuracy constraint (AFLAC).
result AFLAC outperforms domain-invariance-based methods on synthetic and real-world datasets.

Diffusion models' speed-accuracy relations derived from thermodynamics.

problem Understanding the trade-off between model speed and accuracy.
method Connecting diffusion models to thermodynamics and optimal transport.
result Speed-accuracy relations derived, providing insights into optimal learning protocols.

New trade-off found between accuracy and adversarial robustness in regression.

problem Finding a balance between accuracy and robustness in regression models.
method Deriving a fundamental trade-off between standard and adversarial risk in regression with polynomial ridge functions.
result A necessary condition for achieving adversarial robustness without significant accuracy loss.

Learning ReLU networks to high uniform accuracy requires exponentially many samples.

problem Achieving high uniform accuracy on ReLU networks for security-critical applications.
method Quantified the number of training samples needed for any algorithm to guarantee uniform accuracy.
result The minimal number of training samples scales exponentially with network depth and input dimension.

Current OOD benchmarks overestimate model robustness to spurious correlations.

problem Spurious correlations degrade OOD performance, but benchmarks show the opposite.
method Analyze OOD datasets for spurious correlations and derive conditions for robustness.
result Current OOD benchmarks are misspecified and overestimate model robustness.

Proposes a new adversarial model to avoid accuracy vs. adversarial accuracy tradeoff.

problem Inherent tradeoff between accuracy and adversarial accuracy in existing adversarial robustness definitions.
method Introduces Voronoi-epsilon adversary that balances perturbation constraints.
result Voronoi-epsilon adversary avoids accuracy vs. adversarial accuracy tradeoff even with large εε.

The paper tackles fairness and accuracy in ML models under domain shifts.

problem Designing fair and accurate ML models that perform well in unseen domains.
method Theoretical bounds and sufficient conditions for fairness and accuracy transfer under domain generalization.
result A learning algorithm that ensures fair and accurate models even when deployment environments change.

The paper examines how adversarial robustness affects accuracy disparity across different classes.

problem Understanding the impact of adversarial robustness on accuracy disparity across different classes.
method Linear classifiers under a Gaussian mixture model, decomposing the impact into inherent and imbalance effects.
result Adversarial robustness consistently degrades standard accuracy in balanced classes, but the class imbalance ratio plays a different role in accuracy disparity.

New method improves deep RL efficiency by adaptively setting accuracy requirements.

problem Improving efficiency in deep reinforcement learning.
method Accuracy-based curriculum learning using adaptive selection of accuracy requirements.
result Adaptive accuracy requirements lead to better learning efficiency than random selection.

TRUST improves tree models' accuracy while maintaining interpretability.

problem Piecewise-constant regression trees lack in predictive accuracy compared to black-box models.
method Combines Random Forest accuracy with interpretability of shallow trees and sparsity of linear models, using LLMs for explanations.
result TRUST outperforms other interpretable models in predictive accuracy and matches Random Forest's accuracy.

Proposes an accuracy-preserving calibration method for DNNs.

problem Calibration of deep neural networks (DNNs) to measure prediction reliability.
method Uses Concrete distribution on the probability simplex to calibrate DNNs without accuracy loss.
result The proposed method outperforms previous methods in accuracy-preserving calibration tasks.

The paper introduces new Bayesian network classifiers for better classification accuracy.

problem Improving supervised classification accuracy using Bayesian network classifiers.
method Developed novel classes of generative classifiers based on staged tree models, extending Bayesian networks.
result Data-driven learning routines enhance the accuracy of the new classifiers.

Matrix factorization generates investment recommendations for investors.

problem Generating accurate investment recommendations for investors.
method Used matrix factorization and an iterative conjugate gradient method to optimize investment recommendations.
result Achieved highest average prediction accuracy of 13.3% for investors.

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.

Optimizes glmnet configuration for better accuracy and efficiency.

problem Inappropriate glmnet configuration leads to inaccurate solutions and increased computation time.
method Data-driven framework using neural networks to predict accuracy and computation time from dataset characteristics and configuration.
result Automatic selection of optimal configuration maximizing accuracy under a time constraint.

Pruning neural networks can improve test accuracy even with significant parameter reduction.

problem The tradeoff between generalization and stability in neural network pruning.
method Analysis of pruning behavior over training, focusing on instability and its relation to generalization.
result Pruning's benefit to generalization increases with its instability.

Paper proposes using synthetic data to improve face recognition accuracy.

problem Improving face recognition accuracy using real data alone.
method Proposes a GAN that disentangles identity attributes and generates photo-realistic synthetic images.
result Synthetic images generated by the model are photo-realistic and can increase face recognition accuracy.

A new method balances accuracy and diversity in ensemble pruning.

problem Balancing accuracy and diversity in ensemble learning.
method Formalizing ensemble pruning as an objection maximization problem based on information entropy, proposing a distributed framework.
result Achieves less time-consuming execution with minimal accuracy degradation.

SAT improves adversarial training by smoothing the loss landscape through curriculum learning.

problem Adversarial training sacrifices clean accuracy for robustness and suffers from large generalization error.
method SAT uses curriculum learning to smooth the adversarial loss landscape, improving both clean and robust accuracy.
result SAT models improve clean and robust accuracy significantly compared to adversarial training and other baselines.

Removing spurious features can hurt model accuracy and disproportionately affect different groups.

problem Interference from spurious features in robust model performance across different groups.
method Characterization and analysis of spurious feature removal in noiseless overparameterized linear regression.
result Removal of spurious features can decrease accuracy and disproportionately affect different groups, even in balanced datasets.

New method evaluates text-to-image synthesis for realism, variety, and semantic accuracy.

problem Lack of metrics revealing semantic accuracy in text-to-image synthesis.
method Uses Inception network representations and t-SNE visualization for semantic evaluation.
result Classification accuracy of generated images to real images' visual concepts correlates with semantic accuracy.

Paper finds wide minima are better for generalization and proposes a new learning rate schedule.

problem The challenge of finding optimal learning rates for model training.
method The paper introduces a new hypothesis about the density of wide minima and designs an explore-exploit learning rate schedule.
result The explore-exploit learning rate schedule improves model performance and reduces training time.