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

Trend · papers per month

58117175233 · May 202619922001200920172026
48 results for Population Risk

Paper develops a two-population model to assess longevity basis risk.

problem Mismatch between hedger's liability and hedging instrument causes longevity basis risk.
method Develops a two-population mortality model using Lee-Carter model and renewal process.
result Proposed model provides significant risk reduction when mortality jumps and sampling risk are considered.

One primary task of population health analysis is the identification of risk factors that, for some subpopulation, have a significant association with some health condition. Examples include finding lifestyle factors associated with chronic diseases and finding genetic mutations associated with diseases in precision he…

2018-11-27abs ↗pdf ↗

Proposes a federated transfer learning method to improve precision medicine models for underrepresented populations.

problem Underrepresentation of minorities in precision medicine research leads to underperforming risk prediction models.
method Two-way federated transfer learning strategy integrating diverse populations and healthcare institutions.
result Improves risk prediction models for underrepresented populations, reducing performance gaps.

Study models risks for low-carbon economy in Balkan countries, focusing on shadow economy and populism.

problem Risks and uncertainties in establishing a low-carbon economy in Balkan countries with transition economies.
method Transdisciplinary approach combining economic policy, public opinion, and climate change models.
result Identifies shadow economy and populism as key risk factors for low-carbon economy implementation.

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 ↗

New bounds for KANs trained with DP-SGD, addressing correlated noise.

problem Risk bounds for Kolmogorov-Arnold Networks trained by DP-SGD with correlated noise.
method Established new optimization and population risk analysis for KANs trained with DP-SGD, addressing correlated noise.
result First optimization and population risk analysis of correlated-noise mechanisms for DP training in non-convex settings, including neural networks.

We study the Stochastic Gradient Langevin Dynamics (SGLD) algorithm for non-convex optimization. The algorithm performs stochastic gradient descent, where in each step it injects appropriately scaled Gaussian noise to the update. We analyze the algorithm's hitting time to an arbitrary subset of the parameter space. Two…

2017-02-18abs ↗pdf ↗

Population risk is always of primary interest in machine learning; however, learning algorithms only have access to the empirical risk. Even for applications with nonconvex nonsmooth losses (such as modern deep networks), the population risk is generally significantly more well-behaved from an optimization point of vie…

2018-03-25abs ↗pdf ↗

Paper improves privacy-preserving optimization rates for convex functions.

problem Differentially private stochastic convex optimization.
method Algorithmic improvements for convex and strongly convex functions under TNC and non-negative loss.
result Excess population risk bounds for DP-SCO are faster than previous results.

Gradient descent learns a single neuron without knowing the relationship between inputs and labels.

problem Learning a single neuron without knowing the relationship between inputs and labels.
method Using gradient descent to minimize empirical risk over i.i.d. samples, with a nonconvex and nonsmooth optimization problem.
result Gradient descent achieves near-optimal population risk in polynomial time and sample complexity.

Early recognition of risky trajectories during an Intensive Care Unit (ICU) stay is one of the key steps towards improving patient survival. Learning trajectories from physiological signals continuously measured during an ICU stay requires learning time-series features that are robust and discriminative across diverse …

2019-12-20abs ↗pdf ↗

In stochastic optimization, the population risk is generally approximated by the empirical risk. However, in the large-scale setting, minimization of the empirical risk may be computationally restrictive. In this paper, we design an efficient algorithm to approximate the population risk minimizer in generalized linear …

2016-11-21abs ↗pdf ↗

The curse of dimensionality affects neural network optimization, especially with smooth functions.

problem The curse of dimensionality in neural network optimization.
method Examined through the evolution of the parameter distribution under 2-Wasserstein gradient flow.
result The curse of dimensionality persists in neural network optimization, even with smooth functions.

The paper analyzes the maximum margin algorithm's performance on noisy data.

problem Analyzing the performance of maximum margin algorithm on noisy data.
method Finite-sample analysis of maximum margin algorithm applied to noisy data.
result The maximum margin algorithm can achieve nearly optimal population risk with sufficient over-parameterization.

Essential to each other, growth and exploration are jointly observed in populations, be it alive such as animals and cells or inanimate such as goods and money. But their ability to move, crucial to cope with uncertainty and optimize returns, is tempered by the space/time properties of the environment. We investigate h…

2017-12-04abs ↗pdf ↗

Develops certificates for local population-risk increments using cross-fitted ridge calibration.

problem Certifying local population-risk increments in statistical models.
method Cross-fitted ridge calibration for linear feature classes, separating Taylor fluctuations and remainders.
result Certifies measurable updates from the same sample with penalties dependent on empirical geometry.

We present a new approach for mitigating unfairness in learned classifiers. In particular, we focus on binary classification tasks over individuals from two populations, where, as our criterion for fairness, we wish to achieve similar false positive rates in both populations, and similar false negative rates in both po…

2017-06-30abs ↗pdf ↗

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 ↗

Investigates optimal pension policies in PAYG systems with forward utility and ageing population.

problem Optimal investment and pension policies in PAYG systems with sustainability and adequacy constraints.
method Non-zero volatility forward CRRA utilities, closed-form optimal policies, detailed numerical analysis.
result Characterization of optimal policies and detailed impact analysis under various scenarios.

U-aggregation combines multiple models without labels for better risk prediction.

problem Challenges in selecting best model for new populations due to limited data and lack of true labels.
method U-aggregation, an unsupervised model aggregation method that integrates pre-trained models without observed labels.
result U-aggregation improves genetic risk prediction of complex traits using publicly available models.

Study optimizes data collection from biased, costly sources to minimize risk.

problem Estimating population means and group-conditional means from multiple sources with varying costs and biases.
method Develops a sampling plan that maximizes effective sample size, paired with a post-stratification estimator.
result Achieves budgeted minimax optimal risk for estimating population means and group-conditional means.

This work establishes uniform convergence of subdifferentials in stochastic optimization.

problem Understanding how empirical stationary points approximate population ones in nonsmooth, nonconvex stochastic optimization.
method Reduction principle for weakly convex stochastic objectives, focusing on subgradient convergence.
result Sharp uniform convergence rates for subdifferential mappings in stochastic convex-composite optimization.

This work analyzes how users and services adapt to reduce risk, leading to specialization.

problem Adaptation of users and services to reduce risk affects learning and performance.
method Analyzed a class of dynamics where users allocate participation and services update parameters.
result Repeated myopic updates with multiple learners lead to better outcomes than repeated risk minimization.

A government has to finance a risk for its population. It shares the charges among the population with a fixed scale based on economic criteria. Various organisms have to collect and to redistribute fairly the subsidies. Under these conditions, when the size of the organisms is varied, the distribution's laws of the cr…

2014-01-13abs ↗pdf ↗

Study on price formation in financial markets with a single default event.

problem Equilibrium price formation in financial markets with a single default risk.
method Characterized optimal strategies using quadratic-growth BSDEs, derived market-clearing condition, and established mean-field BSDE solvability.
result Characterized equilibrium risk premium and its dependence on default risk factors.

This work aims to provide understandings on the remarkable success of deep convolutional neural networks (CNNs) by theoretically analyzing their generalization performance and establishing optimization guarantees for gradient descent based training algorithms. Specifically, for a CNN model consisting of ll convolution…

2018-05-28abs ↗pdf ↗

Method predicts NAFLD risk with high accuracy and distribution-free coverage guarantees.

problem Insufficient population-level screening tools for NAFLD.
method Gradient-boosted decision trees with conformal prediction.
result Method achieves AUROC of 0.912 internally and 0.891 externally, superior to other models.

Lapse-supported life insurance exacerbates adverse selection risks.

problem Lapse-supported life insurance increases adverse selection costs.
method Modeling 'Term to 100' contracts and analyzing three methods of managing lapse surplus.
result Adverse selection losses can be almost unlimited under certain conditions.

New algorithm finds approximate stationary points faster under differential privacy constraints.

problem Finding approximate stationary points of smooth and Lipschitz functions under differential privacy constraints.
method Developed an efficient algorithm that improves convergence rates to stationary points.
result Achieved faster rates of convergence to stationary points in both finite-sum and stochastic settings.

New algorithms for differentially private optimization in convex and non-convex settings with near-optimal rates.

problem Differentially private optimization in convex and non-convex settings.
method Developed algorithms for convex and non-convex settings with near-optimal excess population risk.
result Achieved near-optimal rates in near-linear time for convex settings and nearly dimension independent rates for non-convex settings.

Paper develops NN models for diabetes screening using NHANES data.

problem Developing accurate predictive models for diabetes in diverse populations.
method Proposes a neural network framework with survey weights, uncertainty quantification.
result Robust risk score models for diabetes in US population.

Study creates a multimodal learning framework for CVD risk prediction.

problem Predicting cardiovascular disease risk in diverse populations.
method Combines cross modal transformers, graph neural networks, and causal representation learning.
result Model predicts personalized CVD risk with causal invariance across subpopulations.

We provide non-asymptotic excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target parameter depends on an unknown nuisance parameter that must be estimated from data. We analyze a two-stage sample splitting meta-algorithm that takes as input ar…

2019-01-25abs ↗pdf ↗

New estimates for the population risk are established for two-layer neural networks. These estimates are nearly optimal in the sense that the error rates scale in the same way as the Monte Carlo error rates. They are equally effective in the over-parametrized regime when the network size is much larger than the size of…

2018-10-15abs ↗pdf ↗

The paper analyzes the generalization performance of spectral clustering algorithms and proposes new methods to improve their effectiveness.

problem Theoretical analysis of spectral clustering's generalization performance.
method Theoretical analysis and development of new spectral clustering algorithms.
result The excess risk bounds of spectral clustering algorithms have a O(1/n)\mathcal{O}(1/\sqrt{n}) convergence rate.

The paper addresses differentially private learning for neural networks, focusing on risk bounds and algorithm feasibility.

problem Achieving differentially private learning for neural networks with theoretical guarantees.
method Developed algorithms and theoretical analysis for differentially private stochastic optimization of neural networks.
result Established theoretical bounds for excess population risk in differentially private learning of neural networks.