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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for structural risk minimization

New framework for conditional risk minimization using optimal transport.

problem High-stakes decisions with side information, especially economic conditions.
method Universal framework based on union-ball formulation in optimal transport.
result Offers interpretability, tractability, and scalability for various risk functionals.

We propose a general approach for supervised learning with structured output spaces, such as combinatorial and polyhedral sets, that is based on minimizing estimated conditional risk functions. Given a loss function defined over pairs of output labels, we first estimate the conditional risk function by solving a (possi…

2016-11-21abs ↗pdf ↗

Paper tackles heavy-tailed data without finite variance, proposing robust risk minimization.

problem Empirical risk minimization under heavy-tailed data with finite pp-th moment.
method Minimizes risk values robustly estimated via Catoni's method, using generalized generic chaining.
result Shows better performance of optimizer based on empirical risks via Catoni-style estimation.

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.

Optimizes insurance pricing to minimize ruin probability under various claim dependencies.

problem Determining optimal insurance premiums in the presence of dependencies between claim occurrences.
method Analyzes both independent and dependent claim processes, considering single and multiple risks.
result Optimal insurance premiums depend on initial reserve and claim dependencies.

We introduce Invariant Risk Minimization (IRM), a learning paradigm to estimate invariant correlations across multiple training distributions. To achieve this goal, IRM learns a data representation such that the optimal classifier, on top of that data representation, matches for all training distributions. Through theo…

2019-07-05abs ↗pdf ↗

We consider the problem of binary classification where one can, for a particular cost, choose not to classify an observation. We present a simple proof for the oracle inequality for the excess risk of structural risk minimizers using a lasso type penalty.

2007-05-16abs ↗pdf ↗

We introduce the concept of coverage risk as an error measure for density ridge estimation. The coverage risk generalizes the mean integrated square error to set estimation. We propose two risk estimators for the coverage risk and we show that we can select tuning parameters by minimizing the estimated risk. We study t…

2015-06-07abs ↗pdf ↗

Machine learning factors outperform traditional portfolio optimization methods.

problem Comparing machine learning and traditional portfolio optimization methods.
method Examined machine learning and factor-based portfolio optimization using autoencoder neural networks and dimensionality reduction techniques.
result Minimum-variance portfolios using latent factors derived from autoencoders and sparse methods outperform simpler benchmarks in risk minimization.

This work characterizes optimal multiclass learning with regularization.

problem The empirical risk minimization (ERM) algorithm fails in multiclass learning settings.
method Using one-inclusion graphs (OIGs), the work introduces optimal learning algorithms that relax structural risk minimization and incorporate unsupervised learning.
result An optimal learner is introduced that uses a local regularization function and an unsupervised learning stage to learn the regularizer.

In the present paper, the primal-dual problem consisting of the investment risk minimization problem and the expected return maximization problem in the mean-variance model is discussed using replica analysis. As a natural extension of the investment risk minimization problem under only a budget constraint that we anal…

2016-09-18abs ↗pdf ↗

This paper uses MIS to identify key financial institutions with minimal risk contagion.

problem Mitigating systemic risk during extreme financial events.
method Applying extreme value theory and MIS from graph theory to identify diversified portfolios.
result Identified a subset of institutions with minimal extremal dependence for diversified portfolios.

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.

We study the pricing and hedging of derivatives in incomplete financial markets by considering the local risk-minimization method in the context of the benchmark approach, which will be called benchmarked local risk-minimization. We show that the proposed benchmarked local risk-minimization allows to handle under extre…

2012-10-08abs ↗pdf ↗

We solve a high-dimensional model where nonlinear autoencoders detect hidden structure missed by PCA.

problem Hidden structure in high-dimensional data not detected by PCA.
method Tractable spiked model with two latent factors, one visible and one uncorrelated.
result Nonlinear autoencoders can extract hidden structure missed by PCA, even if reconstruction loss is higher.

Paper shows robust estimators converge to true risk minimizers at optimal rates.

problem Understanding asymptotic properties of robust risk minimizers.
method Investigates robust analogues of empirical risk minimization, focusing on median of means estimator.
result Robust minimizers converge to true minimizers at optimal rates and have similar asymptotic variance.

We analyze the practices of reservoir computing in the framework of statistical learning theory. In particular, we derive finite sample upper bounds for the generalization error committed by specific families of reservoir computing systems when processing discrete-time inputs under various hypotheses on their dependenc…

2019-10-30abs ↗pdf ↗

We study Spectral Measures of Risk from the perspective of portfolio optimization. We derive exact results which extend to general Spectral Measures M_phi the Pflug--Rockafellar--Uryasev methodology for the minimization of alpha--Expected Shortfall. The minimization problem of a spectral measure is shown to be equivale…

2002-03-29abs ↗pdf ↗

This paper explores portfolio management strategies to maximize alpha and minimize beta.

problem Maximizing returns while minimizing risk in investment portfolios.
method Examines asset allocation, diversification, active management, and risk management strategies.
result Combining these strategies optimizes portfolio performance.

The paper uses stochastic control to analyze interest rate markets with roll-over risk.

problem Analyzing interest rate markets with roll-over risk without classical arbitrage assumptions.
method Stochastic optimal control problems with power-type objective functionals.
result Endogenously determined funding-liquidity spread.

New algorithm improves privacy in high-dimensional machine learning models.

problem Privacy issues in learning large machine learning models.
method Differentially private greedy coordinate descent (DP-GCD) algorithm.
result Achieves logarithmic dependence on dimension for quasi-sparse solutions.

MetaPhysiCa tackles robust physics-informed machine learning for OOD tasks.

problem Designing robust PIML methods for OOD forecasting tasks in physics.
method Meta-learning procedure for causal structure discovery including invariant risk minimization.
result Significantly outperforms existing PIML and deep learning methods in OOD tasks.

A generalization of expectiles for d-dimensional multivariate distribution functions is introduced. The resulting geometric expectiles are unique solutions to a convex risk minimization problem and are given by d-dimensional vectors. They are well behaved under common data transformations and the corresponding sample v…

2017-04-05abs ↗pdf ↗

Paper bounds convergence rate of adversarial surrogate risk.

problem Vulnerability of binary classification models to adversarial attacks.
method Characterizes conditions for adversarial consistency and provides surrogate risk bounds.
result Surrogate risk bounds quantify the rate of convergence of adversarial classification risk.

CV outperforms mean-variance for stock returns, minimizing risk and maximizing growth.

problem Traditional risk assessment methods underperform in stock market analysis.
method Derived new CV equation and used it to analyze stock performance.
result Stocks with low but positive CV grow exponentially, outperforming high-risk stocks.

New guarantees for ERM with adaptively collected data.

problem Failure of ERM guarantees with adaptively collected data.
method Importance sampling weighted ERM algorithm with maximal inequality.
result First generalization guarantees and fast convergence rates for adaptively collected data.

Unified framework for shrinkage, thresholding, and regularization in normal mean estimation and linear regression.

problem Estimation of normal mean in multivariate settings with correlated observations.
method Approximate risk minimization over a functional class of shrinkage-thresholding rules.
result Unified estimator NOMAD for shrinkage, thresholding, and regularization.

We obtain explicit representations of locally risk-minimizing strategies of call and put options for the Barndorff-Nielsen and Shephard models, which are Ornstein--Uhlenbeck-type stochastic volatility models. Using Malliavin calculus for Levy processes, Arai and Suzuki (2015) obtained a formula for locally risk-minimiz…

2015-03-30abs ↗pdf ↗

A new reinforcement learning framework separates users into risk-tolerant and risk-averse groups for better performance.

problem Improving performance for risk-averse users in reinforcement learning.
method Introducing a tiered reinforcement learning approach with two policies: πextOπ^{ ext{O}} and πextEπ^{ ext{E}}.
result Achieving constant regret for risk-averse users, independent of the number of episodes.

The paper explores risk-minimization for exponential additive models, providing mathematical expressions and numerical examples.

problem Risk-minimization in incomplete markets for exponential additive models.
method Derive explicit mathematical expressions for local risk-minimization strategies in exponential additive models.
result Provide necessary conditions for deriving expressions and confirm integrability conditions for specific models.