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

Trend · papers per month

3146289421,256 · Jun 202019922001200920172026
48 results for Empirical Results

Examines optimal risk sharing with realistic risk attitudes, finding risk seeking in certain subdomains.

problem Optimal risk sharing with empirically realistic risk attitudes.
method Allows for risk-seeking agents, generalizes expected utility, and uses counter-monotonic improvement theorem.
result First empirical results on optimal risk sharing with realistic risk attitudes.

Most high-dimensional estimation and prediction methods propose to minimize a cost function (empirical risk) that is written as a sum of losses associated to each data point. In this paper we focus on the case of non-convex losses, which is practically important but still poorly understood. Classical empirical process …

2016-07-22abs ↗pdf ↗

This report is an introduction to mathematical map colouring and the problems posed by Heawood in his paper of 1890. There will be a brief discussion of the Map Colour Theorem; then we will move towards investigating empire maps in the plane and the recent contributions by Wessel. Finally we will conclude with a discus…

2011-06-21abs ↗pdf ↗

Developed accurate empirical potentials for Si:H nanowires using multi-fidelity Gaussian process.

problem Accurate modeling of Si:H nanowires using fast but inaccurate empirical potentials and slow but accurate first-principle calculations.
method Employed multi-fidelity Gaussian process regression to integrate low-fidelity empirical potential data with high-fidelity first-principle calculations.
result Demonstrated the accuracy of developed empirical potentials for Si:H nanowires.

The abstract warns against flawed empirical research in machine learning.

problem Flawed empirical research in machine learning leading to unreliable results.
method Call for more awareness of experimental knowledge plurality and epistemic limitations.
result Current empirical machine learning research should be exploratory, not confirmatory.

A new model of learning corrects for chance to improve learning outcomes.

problem The importance of chance-corrected measures in learning.
method Developed two models: Informatron and AdaBook, based on empirical psychological results.
result Chance correction facilitates learning, as shown by computational results.

We investigate the historical volatility of the 100 most capitalized stocks traded in US equity markets. An empirical probability density function (pdf) of volatility is obtained and compared with the theoretical predictions of a lognormal model and of the Hull and White model. The lognormal model well describes the pd…

2002-02-28abs ↗pdf ↗

Neural Empirical Bayes estimates source distributions from noisy simulations.

problem Estimating source distributions from noisy, simulated data.
method Uses neural density estimators to estimate a prior or source distribution over uncorrupted samples, then performs posterior inference.
result Recovering ground truth source distributions up to symmetries.

Improved bounds for discrete probability distribution estimation under the ℓ∞ norm.

problem Estimating discrete probability distributions under the ℓ∞ norm with improved bounds.
method Minimax bounds in expectation and high-probability tail bounds.
result Resolved open questions posed in Kontorovich and Painsky (JMLR, 2025), including a fully empirical tightest risk bound and identifying the worst-case extremal distribution.

Improved sample complexity for diffusion models without needing empirical risk minimizers.

problem Theoretical limitations in sample complexity for diffusion models.
method Structured decomposition of score estimation error, eliminating dependence on neural network parameters.
result Achieved sample complexity bound of O(ε^(-4)) without empirical risk minimizer access.

Study spectral properties of graph Laplacian for manifold data.

problem Understanding spectral properties of graph Laplacian for manifold data.
method Non-asymptotic error bounds on spectral properties of empirical graph Laplacian.
result Eigenvalues and eigenspaces of empirical graph Laplacian are close to Laplace-Beltrami operator of manifold.

The paper bounds the expectation of empirical processes indexed by Hölder classes.

problem Estimating the expectation of the supremum of empirical processes for distributions on bounded sets.
method Providing upper bounds on the expectation of the supremum of empirical processes indexed by Hölder classes.
result Deriving non-asymptotic risk bounds for estimating distributions using empirical processes and IPM.

Transformers can learn Markov processes with constant depth, surprising results.

problem Understanding how transformers learn context in Markov processes.
method Empirical study and theoretical analysis of attention-based transformers on Markov data.
result Transformers with constant depth can achieve low test loss on Markov sequences, matching empirical and theoretical findings.

The paper improves the empirical bootstrap method for non-normal estimators.

problem Theoretical properties of empirical bootstrap for non-asymptotically normal estimators.
method Establishing limiting distribution, deriving consistency conditions, proposing alternative methods.
result The empirical bootstrap method can be asymptotically consistent under stability conditions.

According to theoretical models of valuing risky corporate securities, risk of default is primary component in overall yield spread. However, sizable empirical literature considers it otherwise by giving more importance to non-default risk factors. Current study empirically attempts to provide relative solution to this…

2013-03-14abs ↗pdf ↗

We give improved constants for data dependent and variance sensitive confidence bounds, called empirical Bernstein bounds, and extend these inequalities to hold uniformly over classes of functionswhose growth function is polynomial in the sample size n. The bounds lead us to consider sample variance penalization, a nov…

2009-07-21abs ↗pdf ↗

Corrects sample selection bias in empirical risk minimization using importance sampling.

problem Statistical learning with biased training data.
method Weighted empirical risk minimization using importance sampling.
result Generalization capacity preserved with estimated importance weights.

Importance sampling has become an important tool for the computation of tail-based risk measures. Since such quantities are often determined mainly by rare events standard Monte Carlo can be inefficient and importance sampling provides a way to speed up computations. This paper considers moderate deviations for the wei…

2013-06-27abs ↗pdf ↗

This paper studies the landscape of empirical risk of deep neural networks by theoretically analyzing its convergence behavior to the population risk as well as its stationary points and properties. For an ll-layer linear neural network, we prove its empirical risk uniformly converges to its population risk at the rat…

2017-05-19abs ↗pdf ↗

TSAW improves MCMC integral estimation with faster convergence.

problem Estimating integrals using MCMC with standard random walks is slow.
method Introduces TSAW to penalize overuse in finite-state adaptive sampling.
result TSAW-based estimators converge faster, achieving O(logt/t)O(\sqrt{\log t}/t) error.

Spectral features of the empirical moment matrix constitute a resourceful tool for unveiling properties of a cloud of points, among which, density, support and latent structures. It is already well known that the empirical moment matrix encodes a great deal of subtle attributes of the underlying measure. Starting from …

2018-10-19abs ↗pdf ↗

Paper analyzes time series prediction using empirical risk minimization.

problem Optimizing 1-step-ahead prediction for time series.
method Empirical risk minimization applied to recursive algorithms for time series forecasting.
result Empirical risk minimization achieves optimal predictive performance.

A new method approximates expected empirical loss for stochastic deep learning tasks.

problem Determining optimal step sizes for stochastic gradient descent in deep learning.
method Applying one-dimensional function fitting to noisy losses of vertical cross sections to approximate expected empirical loss.
result The method leads to a robust and straightforward optimization method that performs well across datasets and architectures.

Addressing the ongoing examination of high-frequency trading practices in financial markets, we report the results of an extensive empirical study estimating the maximum possible profitability of the most aggressive such practices, and arrive at figures that are surprisingly modest. By "aggressive" we mean any trading …

2010-07-15abs ↗pdf ↗

A new DP algorithm for weighted ERM protects sensitive data in predictive models.

problem Protecting sensitive personal information in predictive models trained via ERM.
method Proposes the first differentially private algorithm for weighted ERM with formal privacy guarantees.
result Demonstrates strong DP guarantees while maintaining robust performance in real-world data.

Sharp bounds for max-sliced Wasserstein distances derived for empirical distributions.

problem Estimating the expected max-sliced Wasserstein distance between a probability measure and its empirical distribution.
method Banach space version and operator norm approach for upper bounds.
result Upper bounds for max-sliced Wasserstein distances are essentially matching and sharp up to a log factor.

An important task in computational statistics and machine learning is to approximate a posterior distribution p(x)p(x) with an empirical measure supported on a set of representative points {xi}i=1n\{x_i\}_{i=1}^n. This paper focuses on methods where the selection of points is essentially deterministic, with an emphasis on achi…

2018-03-27abs ↗pdf ↗

This work studies the smooth 1-Wasserstein distance and its limit distribution in high dimensions.

problem Addressing the curse of dimensionality in empirical approximation.
method Conducts a statistical study including limit distribution, bootstrap consistency, and concentration inequalities.
result Derives a nondegenerate limit distribution for empirical SWD, contrasting with classic W1W_1.

The paper analyzes the performance of empirical risk minimization for pp-norm linear regression.

problem Empirical risk minimization on pp-norm linear regression.
method Analyzes performance under various conditions and moment assumptions.
result High probability excess risk bounds for empirical risk minimizer, matching asymptotic rates.

Flexible empirical Bayes for large-scale multiple linear regression.

problem Large-scale multiple linear regression with flexible priors and efficient computation.
method Adaptive shrinkage priors combined with variational approximations for hyperparameter estimation.
result The posterior mean from the empirical Bayes method solves a penalized regression problem.

New measure of robustness for estimators, with tight bounds for Gaussian mean estimation.

problem Developing robust statistical estimators for datasets with noise or outliers.
method Introducing empirical sensitivity as a new robustness measure and proving lower bounds for Gaussian mean estimation.
result Empirical sensitivity bounds for optimal estimators are tight, showing obstructions on mean and variance.

The paper provides bounds for the empirical angular measure and applies them to improve statistical learning in extreme regions.

problem Estimating the angular measure in high-dimensional data with different distributions.
method Established bounds for the maximal deviations of the empirical angular measure from the true measure, using rank transformation and analyzing the most extreme observations.
result The bounds provide performance guarantees for statistical learning procedures in extreme regions, such as binary classification and anomaly detection.

The empirical NTK diverges from the NTK in classification problems during overtraining.

problem The divergence of empirical NTK from NTK in classification problems during overtraining.
method Demonstrated strictly positive definiteness of NTKs for FCNs and ResNets. Proved divergence of neural network parameters during training with cross-entropy loss.
result The empirical NTK does not uniformly converge to the NTK across all times on the training samples as the network width increases.

This research uses empirical copulas to price quanto options, showing significant differences from traditional models.

problem The dependence relation between currency and asset prices affects quanto option pricing.
method Empirical copulas are used to model the dependence between currency and asset prices.
result Empirical copulas provide non-negligible pricing differences compared to traditional models.