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

Trend · papers per month

98196294392 · Jun 202019922001200920172026
48 results for empirical FDP

The paper provides high-probability bounds on false discovery proportions in conformal inference.

problem Existing methods fail to provide high-probability bounds on the realized false discovery proportion.
method Constructing a high-probability envelope for the empirical distribution function of null conformal p-values by sampling from their joint distribution.
result Establishes finite-sample, distribution-free upper bounds on the FDP that hold simultaneously over all possible rejection thresholds.

The paper characterizes SLOPE's trade-off between FDP and TPP, showing its power limit and superiority over Lasso.

problem Characterizing the SLOPE trade-off between FDP and TPP.
method Using variational perspective and Gaussian random designs, the paper derives upper and lower bounds on the optimal trade-off.
result SLOPE outperforms Lasso in terms of FDP, TPP, and l2 estimation risk.

Enhances FDR control in variable selection using neural networks.

problem Balancing rigorous error control with statistical power in high-dimensional variable selection.
method Learning-augmented T-Rex Selector framework with a neural network trained on synthetic datasets.
result Achieves superior detection of true variables compared to existing approaches.

fcHMRF-LIS controls FDR in neuroimaging data, improving power and scalability.

problem Complex spatial dependencies and high variability in FDR control methods for neuroimaging data.
method fcHMRF-LIS integrates LIS-based testing with fcHMRF to model spatial structures efficiently.
result fcHMRF-LIS achieves accurate FDR control, lower FNR, and higher true positives compared to existing methods.

A new diffusion model improves time-series forecasting by preserving seasonal patterns.

problem Improving time-series forecasting accuracy, especially for seasonal data.
method A forward diffusion process that decomposes signals into spectral components, altering only the diffusion process.
result The method maintains high signal-to-noise ratios for dominant frequencies, improving long-term pattern recovery.

This paper studies fairness and privacy in federated learning, proposing algorithms to balance both.

problem Joint impact of differential privacy and fairness in federated classification.
method Proposes FDP-Fair and CDP-Fair algorithms for demographic disparity constrained classification under federated differential privacy.
result Established theoretical guarantees on privacy, fairness, and excess risk control.

Empirical mode modeling improves state-space analysis of noisy data.

problem Analyzing nonlinear systems with noisy data.
method Combining empirical mode decomposition with empirical dynamic modeling.
result Empirical mode modeling enhances state-space representations in noisy data.

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.

The paper examines the tilted empirical risk's generalization and robustness under negative tilt.

problem The generalization error of machine learning algorithms under negative tilt.
method Uniform and information-theoretic bounds on the tilted generalization error under negative tilt.
result The tilted empirical risk's generalization error has a convergence rate of \(O(n^{-ε/(1+ε)})\).

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.

Bayesian Empirical Bayes extends EB to complex structures using probabilistic symmetry.

problem Improving simultaneous inference in complex settings like arrays and graphs.
method Generalized empirical Bayes approach based on probabilistic symmetry.
result BEB outperforms existing methods in denoising arrays and spatial data.

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 ↗

Improved analysis of UCRL2 with empirical Bernstein inequality reduces exploration-exploitation regret.

problem Exploration-exploitation in communicating Markov Decision Processes.
method Analysis of UCRL2 with Empirical Bernstein inequalities (UCRL2B).
result Regret bound of O~(DΓSAT)\widetilde{O}(\sqrt{DΓS A T}) for UCRL2B.

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.

AI agents improve forecast combination in empirical economics.

problem Hidden researcher degrees of freedom in AI-generated code.
method Adapted agent-loop architecture to empirical economics, added holdout evaluation.
result Independent agent searches find better forecast methods than benchmarks.

New approach avoids excess empirical risk in domain generalization.

problem Learning models that generalize to unseen distributions from diverse data sets.
method Minimizes penalty under constraint of optimal empirical risk, leveraging rate-distortion theory.
result Significant improvements in domain generalization performance across multiple methods.

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.

New method estimates Schrödinger bridge potentials via empirical risk minimization.

problem Estimating Schrödinger bridge potentials from samples.
method Rewriting Schrödinger system as a fixed-point equation and estimating the potential via empirical risk minimization.
result Uniform concentration of empirical risk around population counterpart under sub-Gaussian assumptions.

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.

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 ↗

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.

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.

Personal income distributions in Japan are analyzed empirically and a simple stochastic model of the income process is proposed. Based on empirical facts, we propose a minimal two-factor model. Our model of personal income consists of an asset accumulation process and a wage process. We show that these simple processes…

2005-05-25abs ↗pdf ↗

Bayesian networks with latent variables are characterized and their likelihoods compared.

problem Characterizing and comparing likelihoods of Bayesian networks with latent variables.
method Characterized likelihood function and empirical Bayesian network. Proved dominance of global maximum likelihood from empirical model.
result The global maximum likelihood of the original Bayesian network is attained if and only if parameters are consistent with empirical model.

We discuss the problem of risk estimation in the classification problem, with specific focus on finding distributions that maximize the confidence intervals of risk estimation. We derived simple analytic approximations for the maximum bias of empirical risk for histogram classifier. We carry out a detailed study on usi…

2014-08-14abs ↗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.

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 ↗

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.

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.