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

59119178237 · Jun 202019922001200920172026
48 results for mean-field assumption

Existence of strong randomized equilibria in mean-field games with common noise.

problem Existence of strong solutions in mean-field games of optimal stopping.
method Connection with Bank-El Karoui's representation problem and continuity assumptions.
result Existence of strong randomized mean-field equilibrium under certain conditions.

Study Nash equilibrium in mean field portfolio games with random market parameters.

problem Modeling wealth and relative performance in competitive financial markets.
method Martingale optimality principle approach to characterize Nash equilibrium in mean field FBSDE.
result Unique Nash equilibrium found under weak interaction assumption and market parameters independence.

New methods learn correlated equilibria in large games without structural assumptions.

problem Learning correlated equilibria in large, anonymous games with exponential player count.
method Developed Mean-Field correlated and coarse-correlated equilibria, and used classical algorithms to learn them efficiently.
result Efficiently learned correlated equilibria in all games without structural assumptions.

A new particle algorithm improves mean-field variational inference.

problem Efficiently approximating nonparametric posterior distributions in machine learning.
method Introduces PArticle VI (PAVI), a novel particle-based algorithm for nonparametric mean-field approximation.
result Obtains non-asymptotic error bounds for PArticle VI, providing the first end-to-end guarantee for particle-based MFVI.

New RL algorithms achieve optimal policies with polynomial sample complexity for mean-field problems.

problem Statistical efficiency of Mean-Field Reinforcement Learning with general function approximation.
method Introduce MF-MBED to characterize problem complexity, propose algorithms based on maximal likelihood estimation.
result Rich mean-field RL problems have low MF-MBED, leading to polynomial sample complexity.

This work studies clustering in transformer models, proving exponential convergence to a single token state.

problem Understanding the long-term behavior of tokens in transformer models.
method Investigates mean-field transformer models under specific conditions to prove exponential convergence to a single state.
result Transformer models synchronize exponentially fast to a single token state with explicit rates.

Study analyzes adversarial training dynamics without data distribution assumptions.

problem Understanding training dynamics of adversarial training without data distribution assumptions.
method Mean field theory approach to analyze adversarial training in random deep neural networks.
result Upper bounds of adversarial loss derived empirically and theoretically.

New approach finds solutions to games with unbounded controls.

problem Existence of equilibrium in mean-field games with unbounded controls.
method Weak formulation and new existence/stability results for quadratic-growth generalized McKean-Vlasov BSDEs.
result Existence of equilibrium result for non-Markovian mean-field games with unbounded control space.

Study uses neural nets to learn multi-index models in high dimensions, reducing complexity.

problem Learning multi-index models in high-dimensional data.
method Mean-field Langevin dynamics with neural networks.
result Effective dimension controls sample and computational complexity, potentially reducing it.

Global convergence proved for three-layer neural networks in mean field regime.

problem Optimization efficiency of multilayer neural networks in the mean field regime.
method Developed a rigorous framework for mean field limit of three-layer networks using stochastic gradient descent and neuronal embedding.
result Global convergence guarantee for unregularized feedforward three-layer networks in the mean field regime.

Develops a mean-field theory for multi-head self-attention under cross-entropy training.

problem Mean-field analysis of multi-head self-attention under cross-entropy training.
method Mean-field theory for a simplified single-layer causal multi-head self-attention model.
result Proves a static finite-head approximation bound for the optimal risk.

The asymptotic pseudo-trajectory approach to stochastic approximation of Benaim, Hofbauer and Sorin is extended for asynchronous stochastic approximations with a set-valued mean field. The asynchronicity of the process is incorporated into the mean field to produce convergence results which remain similar to those of a…

2011-12-10abs ↗pdf ↗

New method for handling multi-dimensional singular controls with jump costs in mean-field problems.

problem Handling jump costs in multi-dimensional singular controls.
method Introducing two-layer parametrisations to interpolate jumps on both distributional and pathwise levels.
result Derivation of a DPP and characterisation of the value function as a minimal super-solution to a quasi-variational inequality.

Uniform bounds for neural network convergence without strong convexity assumptions.

problem Understanding the convergence of neural networks in the feature-learning regime.
method Establishing uniform-in-time weak propagation-of-chaos via mean-field deterministic Wasserstein-gradient-flow dynamics.
result Uniform bounds on the difference between infinite-width and finite-width neural network outputs, showing that fewer neurons can achieve a desired loss.

Deep Bayesian neural nets can use simpler weight approximations without sacrificing performance.

problem The need for complex weight posterior approximations in deep Bayesian neural networks.
method Theoretical and empirical analysis of mean-field variational inference in deep networks.
result Mean-field variational weight posteriors in deep networks can induce similar function-space distributions as complex approximations in shallower networks.

Develops a dynamic mean field theory for reinforcement learning.

problem Finite state and action Bayesian reinforcement learning in large state spaces.
method Analogies with statistical physics, interpreting probabilities as couplings and values as spins, solving mean field equations.
result State-action values are statistically independent in the asymptotic state space limit, with exact or approximate equations for computation.

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.

Develops asset pricing models with mean field game theory for heterogeneous agents.

problem Tackles equilibrium asset pricing in incomplete markets with heterogeneous agents.
method Uses mean field game theory and mean field backward stochastic differential equations (BSDEs).
result Derives equilibrium risk premium and shows market clearing in the large population limit.

Deep learning relies on good initialization schemes and hyperparameter choices prior to training a neural network. Random weight initializations induce random network ensembles, which give rise to the trainability, training speed, and sometimes also generalization ability of an instance. In addition, such ensembles pro…

2018-06-17abs ↗pdf ↗

A new causal deepset framework improves off-policy evaluation under complex interference.

problem Handling spatio-temporal interference in off-policy evaluation.
method Permutation invariance assumption and novel algorithms incorporating it.
result Significantly more precise estimations than existing methods.

We provide bounds on control learning error in stochastic systems.

problem Learning optimal controls in stochastic environments with uncontrolled parts.
method Dynamic programming and mean-field interpretation of neural networks.
result Non-asymptotic bounds on generalization error for stable overparametrised settings.

Improved model for non-smooth signals with complex spectra.

problem Current models struggle with non-smooth signals and complex spectral structures.
method CGPCM and RGPCM models with causality and Bayesian nonparametric interpretations, improved variational inference.
result Proposed models show better performance on synthetic and real-world data.

We formulate a stochastic game of mean field type where the agents solve optimal stopping problems and interact through the proportion of players that have already stopped. Working with a continuum of agents, typical equilibria become functions of the common noise that all agents are exposed to, whereas idiosyncratic r…

2016-05-30abs ↗pdf ↗

Centralized exchanges influence staking behavior and decentralization in Proof of Stake blockchain ecosystems.

problem How do centralized exchanges affect staking behavior and decentralization in Proof of Stake blockchain ecosystems?
method Formulate a continuous-time mean field model of miners as validators and traders in a centralized market.
result Centralized trading activities enhance staking participation and promote decentralization through market incentives.

RL in MFGs is as hard as solving many single-agent RL problems.

problem Learning Nash Equilibrium in Mean-Field Games (MFGs).
method Introduce P-MBED to measure model complexity, develop a novel exploration strategy, and establish polynomial sample complexity results.
result Learning Nash Equilibrium in MFGs is no more statistically challenging than solving a logarithmic number of single-agent RL problems.

New method for high-dimensional linear regression using empirical Bayes.

problem Estimating prior in high-dimensional linear regression.
method Variational empirical Bayes approach with NPMLE and mean field approximation.
result Established asymptotic consistency and computational efficiency of the method.

Neural networks with a large number of parameters admit a mean-field description, which has recently served as a theoretical explanation for the favorable training properties of "overparameterized" models. In this regime, gradient descent obeys a deterministic partial differential equation (PDE) that converges to a glo…

2019-02-05abs ↗pdf ↗

A theoretical performance analysis of the graph neural network (GNN) is presented. For classification tasks, the neural network approach has the advantage in terms of flexibility that it can be employed in a data-driven manner, whereas Bayesian inference requires the assumption of a specific model. A fundamental questi…

2018-10-29abs ↗pdf ↗

Study Epstein-Zin preferences in mean field portfolio games, proving unique equilibria.

problem Analyzing portfolio games with Epstein-Zin preferences under non-Markovian conditions.
method Proves a one-to-one correspondence between Nash equilibria and BSDE solutions, using local stochastic maximum principle tailored to Epstein-Zin utility.
result Establishes uniqueness of equilibria in mean field portfolio games under Epstein-Zin preferences.

Mean field theory explains gradient backpropagation in deep dropout networks.

problem Understanding gradient backpropagation in deep dropout networks.
method Applied mean field theory to dropout networks, considering realistic training conditions.
result Gradient backpropagation length is limited by depth scales, not just independence assumption.

New method improves uncertainty estimation in complex statistical models.

problem Challenges in estimating high-dimensional mixed models due to computational complexity.
method Partially factorized variational inference to relax mean-field assumption.
result Relaxed variational inference provides accurate uncertainty quantification without high computational cost.

Study shows how deep residual networks can be analyzed as shallow network ensembles for optimization.

problem Understanding why deep neural networks can be trained to zero loss despite non-convex optimization landscapes.
method Mean-field analysis of deep residual networks, focusing on their continuum limit as a two-layer network.
result Derives the first global convergence result for multilayer neural networks in the mean-field regime.

Study explores optimal strategies in games with multiple players and mean-field interactions.

problem Optimal strategies in games with multiple players and mean-field interactions.
method Exploration of three different notions of optimality, including mean-field control solution, mean-field coarse correlated equilibria, and mean-field Nash equilibria.
result Approximation of cooperative and competitive equilibria in large NN-player games by mean-field control and mean-field equilibria.

Graphon game model simplifies stochastic interactions among agents.

problem Complex interactions among heterogeneous agents in stochastic games.
method Introduced a discrete-time graphon game formulation with a representative player.
result Existence and uniqueness of graphon equilibrium proven with mild assumptions.

Unified q-learning for mean-field jump-diffusion models with unobservable population distribution.

problem Continuous-time q-learning in mean-field jump-diffusion models with unobservable population distribution.
method Proposed decoupled Iq-function for unified policy evaluation in MFG and MFC problems; unified q-learning algorithm based on test policies and averaged martingale orthogonality condition.
result Unified policy evaluation rule for MFG and MFC problems based on decoupled Iq-function.