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

Trend · papers per month

4488132176 · Jun 202019922001200920182026
48 results for fitness gain

Cooperation benefits entities by reducing fluctuation effects, leading to higher growth rates.

problem Why is cooperation favored in evolution despite entities giving up resources?
method Analysis of evolutionary processes as multiplicative and noisy, focusing on the non-ergodicity of fluctuations.
result Pooling and sharing resources increases the long-time growth rate for cooperating entities, leading to a net fitness gain.

Investment horizon approach has been used to analyze indexes of Polish stock market.Optimal time horizon for each return value is evaluated by fitting appropriate function form of the distribution. Strong asymmetry of gain-loss curves is observed for WIG index, whereas gain and loss curves look similar for WIG20 and fo…

2006-08-22abs ↗pdf ↗

Study improves understanding of network degree distributions using non-linear ERGs.

problem Lack of models capable of accounting for the variance of empirical degree distributions.
method Defined a fitness-induced variant of the two-star model to reproduce sample variance.
result Non-linear ERGs can reproduce the sample variance of empirical degree distributions.

Optimistic estimate predicts best fitting performance of nonlinear models.

problem Evaluating the potential of nonlinear models in fitting.
method Proposes an optimistic estimate to quantify the smallest sample size for fitting nonlinear models.
result Predicts specific subsets of targets that can be fitted at overparameterization.

This paper explores machine learning landscapes using molecular energy analogy.

problem Understanding the solution space and nature of predictions in machine learning.
method Analogy with molecular potential energy landscapes to explore machine learning landscapes.
result Emergent properties of machine learning landscapes can be related to molecular structure, thermodynamics, and kinetics.

Kernel-embedding tests can be suboptimal, but a simple modification improves their performance.

problem Optimizing goodness-of-fit tests using kernel embeddings.
method Analyzing and modifying kernel-embedding based goodness-of-fit tests within a minimax framework.
result A moderated kernel-embedding approach provides optimal tests for various deviations and is adaptive over a wide range of spaces.

This paper defines resource-constrained classifier performance and its impact on algorithm choice.

problem Classification tasks in resource-constrained settings where actions are limited.
method Defines resource-constrained classifier performance and discusses gains and lift.
result Gains and lift metrics can lead to different algorithm choices.

Study examines how body segments respond to random vibrations.

problem Understanding human body responses to random vibrations.
method 35 participants were tested with random noise signals. Multiple linear regression models were created to determine influential predictors of peak translational gains.
result Multiple predictors, including motion direction and body segment, significantly influence peak translational gains.

Improved estimators for causal inference using cross-fitting and undersmoothing.

problem Estimating expected conditional covariance in causal inference.
method Double cross-fit doubly robust (DCDR) estimators with undersmoothing for non-smooth nuisance functions.
result DCDR estimators achieve n\sqrt{n}-consistency and asymptotic normality under minimal conditions.

Study semi-supervised learning with noisy proxy covariates, deriving bounds and showing gains.

problem Learning from noisy proxy covariates with scarce labels.
method Two-stage estimator learning kernel eigenfeatures from all proxy covariates and fitting a ridge predictor on labeled data.
result Finite sample bounds show fast labeled sample rates and consistent gains over supervised and semi-supervised baselines.

Proposes using prior variable importance information in high-dimensional regression.

problem Using vague prior information on variable importance in high-dimensional settings.
method Fit a sequence of models indicated by the prior importance orderings, using ridge or Lasso regression.
result Cross-validation can select the best estimator from a sequence of models, with a logarithmic cost compared to the unknown best.

Enhanced detection of sneutrinos at the LHC using machine learning.

problem Detecting rare new physics signals in the presence of significant backgrounds.
method Machine learning models (XGBoost and deep neural network) applied to template fit analysis.
result Template fit outperforms simple cuts in enhancing sneutrino detectability.

New insights into overfitting peaks in generalization error for l2l_2 and l1l_1 penalized interpolation.

problem Understanding the phenomenon of overfitting peaks in generalization error for modern machine learning models.
method Introducing a generative and fitting model pair (MiSpaR) and deriving analytical risk curves for l2l_2 and l1l_1 penalties.
result The overfitting peak can be dissociated from the point of model flexibility, complicating the interpretation of overfitting as a boundary between classical and modern regimes.

Enhanced visual feature attribution via adaptive baseline weighting.

problem IG's sensitivity to baseline images leads to noisy or unstable explanations.
method Weighted Integrated Gradients (WG) evaluates and weights baselines for improved reliability.
result WG improves over Expected Gradients (EG) by up to 36% across various models.

Paper develops MOSP for online resource allocation with sub-linear regret and fit.

problem Adversarial online convex optimization with delayed constraints.
method Developed a modified online saddle-point (MOSP) scheme for dynamic network resource allocation.
result MOSP achieves sub-linear dynamic regret and fit.

Study of historic stock returns distributions, highlighting asymmetry and outliers.

problem Understanding the asymmetry in accumulated gains and losses in stock returns over time.
method Analyzing decades-long historic distributions of S&P500 returns, comparing gains and losses, using statistical U-tests and fitting log-log scale linearly.
result The mean of de-trended distributions increases linearly with the number of days of accumulation, and the overall skew is negative, indicating heavier tails of losses.

Algorithm estimates parameters over time-varying graphs without special assumptions.

problem Estimating parameters over time-varying graphs without assuming independence.
method Decentralized online regularized learning with innovation, consensus, and regularization terms.
result Estimations converge almost surely under certain conditions.

Optimal feature learning strength improves generalization in deep networks.

problem Understanding how feature learning strength affects generalization in practical settings.
method Empirical studies and theoretical analysis of gradient flow dynamics in two-layer ReLU nets.
result Optimal feature learning strength yields substantial generalization gains, contrary to the prevailing intuition.

How can we model networks with a mathematically tractable model that allows for rigorous analysis of network properties? Networks exhibit a long list of surprising properties: heavy tails for the degree distribution; small diameters; and densification and shrinking diameters over time. Most present network models eithe…

2008-12-29abs ↗pdf ↗

Optimistic search speeds up change point detection in large datasets.

problem Efficiently detecting change points in large-scale data with high computational demands.
method Adaptive logarithmic queries to reduce evaluation complexity.
result Asymptotic minimax optimality and fast localization rates for change point detection.

Monte Carlo (MC) techniques are often used to estimate integrals of a multivariate function using randomly generated samples of the function. In light of the increasing interest in uncertainty quantification and robust design applications in aerospace engineering, the calculation of expected values of such functions (e…

2011-08-24abs ↗pdf ↗

The study analyzes how neural reward models learn features for policy optimization in a Gaussian single-index model.

problem Reward modeling in policy optimization and its impact on downstream value.
method Two-stage neural reward model: first learns hidden direction, then fits readout layer.
result For any feature-learning temperature above a dimension-free threshold, a constant fraction of neurons recover the hidden direction.

FQE with deep neural networks achieves asymptotic normality and finite-sample bounds.

problem Theoretical understanding of FQE with general differentiable function approximators.
method Z-estimation theory applied to FQE with deep neural networks.
result FQE estimation error is asymptotically normal with explicit variance.

This paper presents an improvement to model learning when using multi-class LogitBoost for classification. Motivated by the statistical view, LogitBoost can be seen as additive tree regression. Two important factors in this setting are: 1) coupled classifier output due to a sum-to-zero constraint, and 2) the dense Hess…

2011-10-18abs ↗pdf ↗

A new method calibrates value predictions in offline RL to improve reliability.

problem Difficulty in long-horizon value prediction in offline reinforcement learning.
method Bellman calibration, a weak reliability criterion, and Iterated Bellman Calibration.
result Finite-sample guarantees show that Bellman calibration error is controlled at nonparametric rates.

The stochastic block model (SBM) is a popular tool for community detection in networks, but fitting it by maximum likelihood (MLE) involves a computationally infeasible optimization problem. We propose a new semidefinite programming (SDP) solution to the problem of fitting the SBM, derived as a relaxation of the MLE. W…

2014-06-21abs ↗pdf ↗

Reducing volatility proxy improves apparent market correlation dynamics.

problem Attributing apparent slow collective market dynamics to intrinsic or driver inheritance.
method Coupled Ornstein-Uhlenbeck model with VIX proxy, decomposing and controlling for autocorrelation.
result VIX-coupled model reduces effective relaxation time from 298 to 61 trading days, improving fit over bare mean reversion.

Paper proposes robust reinforcement learning method for better real-world application.

problem Overfitting in reinforcement learning algorithms limits their applicability to real-world scenarios.
method Formalizes robust reinforcement learning as a min-max game with a Wasserstein constraint and proposes an efficient solver.
result Significant gains in performance on high-dimensional MuJuCo environments compared to standard and robust algorithms.

SGD learns a simple network for multi-class classification from mixtures of well-separated distributions.

problem Learning overparameterized neural networks for multi-class classification.
method Stochastic Gradient Descent (SGD) on structured data.
result SGD learns a network with small generalization error from mixtures of well-separated distributions.

Study tests how U.S. equity prices align with global asset frequencies using financial variables.

problem Testing whether U.S. equity prices align with global asset frequencies using financial variables.
method Examines SPX and RUT gaps, uses OIS-based funding, volatility, trading-friction, financial-condition variables, and residual information.
result Gains in fit survive broad-dollar neutralization, alternative blocks, PCA, residualization, and nested horizon selection, supporting reduced-form P-Q alignment.

New architecture improves decision-making in dense traffic.

problem Designing accurate and compact learning architectures for autonomous vehicles in crowded conditions.
method Attention-based architecture that accounts for interactions between vehicles.
result Significant performance gains and interpretable interaction patterns.

L1-orthogonal regularization improves decision tree explainability of deep neural networks.

problem Lack of explainability in deep neural networks.
method L1-orthogonal regularization during training of decision trees.
result Decision trees closely approximate trained deep neural networks with improved accuracy and fidelity.

Earth observation embeddings can convert discrete biome maps into continuous representations that better capture ecological variation.

problem Biome maps impose categorical boundaries that compress continuous variation in biotic communities.
method Fit a linear classifier on Earth observation embeddings to predict biome labels.
result Continuous biome representation outperforms discrete biome labels for predicting species occurrence.