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

Trend · papers per month

99199298397 · Jun 202019922001200920172026
48 results for population limit

Infinitesimal boosting converges to a deterministic process in large sample limit.

problem Characterizing the asymptotic behavior of infinitesimal gradient boosting in large sample sizes.
method Proving convergence to a deterministic process using large sample theory and differential equations.
result The test error decreases over time in the population limit.

Study shows finite agent equilibrium converges to mean-field limit in asset pricing.

problem Asset pricing equilibrium in markets with finite vs infinite agents.
method Existence of finite agent equilibrium and strong convergence to mean-field limit.
result Finite agent equilibrium converges to mean-field limit under suitable conditions.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

problem Limitations of Taylor diagram in capturing non-linear relationships and sensitivity to outliers.
method Proposes a kernelized version of the Taylor diagram that uses maximum mean discrepancy and kernel mean embedding.
result Kernelized Taylor diagram visualizes data populations with minimal assumptions of data distributions.

We study the top-KK ranking problem where the goal is to recover the set of top-KK ranked items out of a large collection of items based on partially revealed preferences. We consider an adversarial crowdsourced setting where there are two population sets, and pairwise comparison samples drawn from one of the populat…

2016-02-15abs ↗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.

Aims to describe neural network training dynamics using two-time-scale models.

problem Lack of a general mathematical description of neural network training.
method Introduces a theoretical framework based on two-time-scale population dynamics.
result Derives selection-mutation equations and effective fitness for hyperparameters.

This paper addresses external validity bias in causal inference.

problem Estimating causal effects in a target population.
method Synthesis of approaches for generalizability and transportability, including tests for heterogeneity of treatment effects and differences between study and target populations.
result Framework for addressing external validity bias in causal inference.

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.

ScoreFusion fuses multiple diffusion models to enhance generative modeling of a target population.

problem Enhancing generative modeling of a target population with limited data.
method ScoreFusion uses KL barycenters of auxiliary populations and recasts the learning problem as score matching in denoising diffusion.
result ScoreFusion achieves a dimension-free sample complexity bound in total variation distance.

We introduce an algorithmic method for population anomaly detection based on gaussianization through an adversarial autoencoder. This method is applicable to detection of `soft' anomalies in arbitrarily distributed highly-dimensional data. A soft, or population, anomaly is characterized by a shift in the distribution o…

2018-05-05abs ↗pdf ↗

Study controlled contagion with state-dependent killing, proving a comparison principle.

problem Analyzing controlled McKean--Vlasov contagion with state-dependent killing.
method Proof of a comparison principle using Wasserstein smooth-gauge comparison and killing-jump absorption estimates.
result Established a comparison principle for the two-population killed-particle HJB.

Machine learning's predictive power is limited by sample size, as shown by the Limits-to-Learning Gap.

problem The limitations of machine learning in approximating true data-generating processes.
method Characterization of a universal lower bound (LLG) quantifying the discrepancy between empirical fit and population benchmark.
result Standard ML approaches can substantially understate true predictability in financial data.

MFM integrates multiple evolving populations using Wasserstein manifold flows.

problem Learning dynamics of multiple interacting populations evolving over time.
method Meta Flow Matching (MFM) integrates vector fields on Wasserstein manifold using amortized flow models and GNN embeddings.
result MFM improves prediction of individual treatment responses on multi-patient single-cell drug screen data.

CLSB models system dynamics from cross-sectional data with population-level regularization.

problem Challenges in modeling system dynamics from limited cross-sectional samples and heterogeneous individual behaviors.
method Introduces CLSB framework for learning dynamics, regularized for population-level temporal variations.
result Empirically superior in single-cell sequencing data analyses, e.g., simulating cell development and drug response.

Develops an equilibrium model for securities pricing in a mixed cooperative and non-cooperative market.

problem Equilibrium pricing of securities in a market with cooperative and non-cooperative agents.
method Conditional extended mean-field control for cooperative agents, mean-field model for both cooperative and non-cooperative agents.
result Existence of a unique equilibrium for both finite-agent and mean-field models under certain conditions.

Study on the limits of learning HMM parameters under various conditions.

problem Understanding the conditions under which hidden Markov model parameters can be learned.
method Nonasymptotic minimax upper and lower bounds, thresholds analysis.
result Nonasymptotic minimax bounds match up to constants, showing learnable thresholds.

New method estimates treatment effects across different populations.

problem Estimating treatment effects across populations with changing distributions.
method SBRL-HAP framework combining balancing and independence regularizers with hierarchical attention.
result Significant improvement in HTE estimation across out-of-distribution populations.

Policy mirror ascent achieves Nash equilibrium in mean field games without a population generative model.

problem Achieving Nash equilibrium in mean field games without a population generative model.
method Policy mirror ascent, contractive operator, single-path TD learning.
result Policy mirror ascent converges to Nash equilibrium within O~(ε2)\widetilde{\mathcal{O}}(\varepsilon^{-2}) samples.

Study uses MFG approach to model equilibrium pricing with market clearing condition.

problem Continuous asset pricing with market clearing condition.
method Mean field game approach to solve forward-backward SDEs of McKean-Vlasov type.
result Net order flow converges to zero in large N-limit with specified conditions.

Study on order book dynamics with uniform catastrophes, explaining volatility and trends.

problem Understanding volatility and trends in financial markets with different types of liquidity.
method Stochastic models and population processes with uniform catastrophes.
result Law of large numbers, central limit theorem, and large deviations proved for the model.

New method finds minimum in noisy data, useful for model selection.

problem Finding the index of the minimum value in noisy observations.
method Developed an asymptotically normal test statistic integrating cross-validation and differential privacy.
result Achieves a favorable bias-variance trade-off in practical scenarios.

Novel approach for robust domain generalization in health studies.

problem Challenges in making statistical inferences about underrepresented minority groups.
method Structured tensor completion for multi-dimensional domain generalization in linear regression models.
result Established rigorous theoretical guarantees and demonstrated minimax optimality.

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.

Polyak step size GD reaches final radius of convergence after log iterations.

problem Statistical and computational complexities of Polyak step size GD.
method Generalized smoothness and Lojasiewicz conditions, stability of gradients.
result Polyak step size GD reaches final statistical radius of convergence after logarithmic number of iterations.

Study on optimal trading in a finite population with market frictions and asymmetric information.

problem Optimal trading in a finite population with market frictions and asymmetric information.
method Investigates stochastic differential games with asymmetric information and market frictions, proving existence and uniqueness of Nash and Stackelberg-Nash equilibria.
result Existence and uniqueness of Nash and Stackelberg-Nash equilibria in both unconstrained and constrained trading scenarios.

Study proves convergence of subgradients for optimal transport-based objectives.

problem Ensuring statistical consistency and optimization stability in transport-based models.
method Proves graphical convergence of subdifferentials to the subdifferential of the population objective.
result Standard subgradient methods consistently approach stationary points of the population-level problem.

This work shifts focus from prediction to intervention in social systems.

problem The limitations of focusing solely on prediction in automated decision systems.
method Shift from prediction-focused paradigm to intervention-oriented approach.
result A new perspective unifies statistical frameworks and tools for ADS design, implementation, and evaluation.

Semi-supervised learning benefits the rich more than the poor, affecting fairness.

problem Disparate impact of semi-supervised learning on different sub-populations.
method Theoretical and empirical analysis of a broad family of SSL algorithms using pseudo-labels.
result Semi-supervised learning benefits the rich more than the poor, potentially violating fairness.

Operator calculus for population-based optimization provides a unified framework for analyzing convergence of various methods.

problem Convergence analysis of population-based optimization methods
method Introduce an operator calculus for describing composite mean-field algorithms as compositions of elementary operators acting on probability measures.
result Establish a modular Lyapunov principle for certifying exponential decay of state-space Lyapunov function and search errors.

This paper highlights the size-dependency of income distributions, i.e. the income distribution curves versus the population of a country systematically. By using the generalized Lotka-Volterra model to fit the empirical income data in the United States during 1996-2007, we found an important parameter λλ can scale wi…

2010-12-09abs ↗pdf ↗

The paper develops methods to identify stable associations across multiple studies.

problem Identifying stable associations across multiple studies with possible distributional shifts.
method Modeling heterogeneous multi-source data with multiple high-dimensional regressions and devising a novel sampling method for valid confidence intervals of maximin effects.
result Significant maximin effects indicate stable associations that can be generalized to target populations.

With the aim of building machine learning systems that incorporate standards of fairness and accountability, we explore explicit subgroup sample complexity bounds. The work is motivated by the observation that classifier predictions for real world datasets often demonstrate drastically different metrics, such as accura…

2019-10-24abs ↗pdf ↗

RKD improves clustering in semi-supervised learning with limited labels.

problem Improving clustering accuracy in semi-supervised learning with few labeled examples.
method RKD as spectral clustering on a teacher model's graph, with clustering error quantification.
result RKD provably leads to low clustering error in semi-supervised classification problems.

Improved covariance matrix estimation for multiple classes with limited data.

problem Estimating covariance matrices for multiple classes with scarce data.
method Coupled regularized sample covariance matrix estimator (RSCM) that combines pooled SCM and scaled identity matrix for regularization.
result The coupled RSCM estimators outperform cross-validation in classification tasks with comparable accuracy but faster computation.

Learning to optimize has emerged as a powerful framework for various optimization and machine learning tasks. Current such "meta-optimizers" often learn in the space of continuous optimization algorithms that are point-based and uncertainty-unaware. To overcome the limitations, we propose a meta-optimizer that learns i…

2019-11-09abs ↗pdf ↗