Extends Langevin dynamics for constrained domains.
problem Optimization of constrained probability measures.
method Mirror mean-field Langevin dynamics (MMFLD).
result Linear convergence guarantees and propagation of chaos results.
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.
169,181 papers · 148 categories
Trend · papers per month
48 results for “mean-field domain”
Algorithm generates private continuous-time data for sensitive domains.
problem Private generation of continuous-time data for sensitive domains.
method Mean-field Langevin dynamics and noisy particle gradient descent.
result Strong privacy guarantees for one-time data contributions.
We prove uniqueness of solutions to complex Monge-Ampère equations for small temperature.
problem Proving uniqueness of solutions to complex Monge-Ampère equations.
method Local and global analysis of bounded hyperconvex domains and compact complex manifolds.
result Uniqueness of solutions confirmed for small temperature parameters.
Given a regular bounded domain , we describe the limiting behavior of sequences of solutions to the mean field equation of order , , under the Dirichlet boundary condition and the bound . We emphasize the connection wi…
Research explores how interconnected systems synchronize and how to control their behavior.
problem Understanding and controlling the behavior of interconnected dynamical systems.
method Mean field games approach applied to controlled coupled oscillators.
result Developed methods to predict and influence emergent phenomena in interconnected systems.
Paper studies optimal tracking portfolio in mean field game of large fund competition.
problem Optimal tracking portfolio in large fund competition with relative performance benchmark.
method Formulated mean field game problem, established existence of mean field equilibrium using PDE approach, constructed approximate Nash equilibrium.
result Existence of mean field equilibrium and consistency condition verified.
Ising distribution as a latent variable modelcond-mat.dis-nn
This study suggests replacing Ising distribution with Cox distribution.
problem Handling correlated binary data efficiently.
method Exploring conditions for replacing Ising distribution with Cox distribution as a latent variable model.
result The Ising distribution can be treated as a latent variable model with a quasi-normal distribution.
The paper proves existence of solutions for mean field equations on compact Riemann surfaces.
problem Existence of solutions for mean field equations on compact Riemann surfaces.
method Min-max scheme introduced by Djadli-Malchiodi (2006) and Djadli (2008).
result Proves existence of solutions for mean field equations on compact Riemann surfaces.
Paper develops a new method for solving complex problems in generative modeling and mean-field games.
problem Solving complex problems in generative modeling and mean-field games.
method Reinterpreting Generalized Schrödinger Bridges (GSBs) as probabilistic models and using the nonlinear Feynman-Kac lemma.
result Demonstrates the efficacy of the new method in generative modeling and mean-field games.
Paper adds Fisher Information to mean field optimization for faster convergence.
problem Mean field optimization in neural networks training.
method Developed energy-dissipation method and gradient flow on probability space.
result Marginal distributions converge exponentially to minimizer.
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 -player games by mean-field control and mean-field equilibria.
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.
Existence of Strong Randomized Equilibria in Mean-Field Games of Optimal Stopping with Common Noisemath.OC
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.
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.
We analyze training dynamics in Gaussian mixture models using a comparison theorem.
problem Analyzing training algorithms with Gaussian mixture data.
method Applying a Gaussian comparison theorem to a specific family of training algorithms.
result Validated dynamic mean-field expressions and provided iterative refinement schemes.
Elman-type RNNs converge to globally optimal solutions in the mean-field regime.
problem Optimizing feature learning in wide RNNs.
method Analysis of gradient descent dynamics and mean-field limits.
result Fixed points of infinite-width dynamics are globally optimal.
Study on mean field games with singular controls and their applications.
problem Optimal productivity expansion in dynamic oligopolies.
method Existence and uniqueness of mean field equilibria through nonlinear equations, Abelian limit for discounted and ergodic games.
result Valid connection between discounted and ergodic games, approximation of Nash equilibria.
Theory explains how recurrent networks remember sequences.
problem Understanding how recurrent networks remember sequences and perform well.
method Mean field theory and random matrix theory applied to RNNs with gating mechanisms.
result Gated RNNs outperform non-gated RNNs in remembering sequences.
Study shows convergence of Nash equilibria to mean field game limit.
problem Convergence of Nash equilibria to mean field game limit in games of optimal stopping.
method Analysis of convergence of -player equilibria to mean field equilibria.
result Mean field equilibria satisfying a transversality condition are limit points of -player equilibria, but not all mean field equilibria are limits.
Study shows uniform-time chaos propagation in mean field Langevin dynamics.
problem Understanding the convergence of marginal distributions in mean field dynamics.
method Assumed functional convexity of energy, used -convergence and Wasserstein metrics.
result Uniform-in-time propagation of chaos proved in both -Wasserstein and relative entropy.
Mean-Field Networkscs.LG
The mean field algorithm is a widely used approximate inference algorithm for graphical models whose exact inference is intractable. In each iteration of mean field, the approximate marginals for each variable are updated by getting information from the neighbors. This process can be equivalently converted into a feedf…
New SDEs use -Brownian motion, extending mean-field models.
problem Extending mean-field models to new types of stochastic processes.
method Introduced -SDEs with coefficients dependent on current state and solution as random variable.
result Validated new SDE framework for complex stochastic systems.
New neural networks learn mappings between probability measures and functions.
problem Learning mappings between Wasserstein space of probability measures and function spaces.
method Two types of neural networks: bin density and cylindrical approximation, are proposed and supported by universal approximation theorems.
result Accuracy and efficiency of mean-field neural networks in generalization error with various test distributions.
The paper studies continuous submodular functions and their optimization.
problem Maximizing continuous submodular functions in poly. time.
method Characterization of continuous submodularity, operations preserving it, and algorithms for constrained maximization.
result Continuous submodularity is equivalent to a weak DR property, leading to continuous DR-submodular functions with the full DR property.
Study equilibrium consumption habits in a large population using mean field games.
problem Equilibrium consumption under external habit formation in a large population.
method Formulated and solved mean field games for linear and multiplicative habit formation preferences, constructed approximate Nash equilibria for large n-player games.
result Characterized mean field equilibrium strategies and derived financial implications.
Model connects financial contagion models to mean field analysis.
problem Systemic risk in financial networks.
method Combines Eisenberg-Noe and mean field models.
result Mean field limit derived from finite bank system.
Study of portfolio management under relative performance concerns using mean field games.
problem Portfolio management problems under relative performance concerns.
method Forward utilities of CARA type, mean field games, best response and equilibrium strategies.
result Solve forward-utility finite player game and mean-field game under asset specialization.
Paper studies convergence of Mean-Field GDA dynamics for MNE of continuous games.
problem Finding mixed Nash equilibria in continuous games.
method Two-scale Mean-Field Gradient Descent Ascent dynamics.
result Two-scale Mean-Field GDA converges exponentially to MNE without convexity assumptions.
Study multiple-population games using McKean-Vlasov equations.
problem Mean field games and control problems with multiple populations.
method Coupled forward-backward SDEs and Pontryagin's principle.
result Existence of mean field equilibria under various cooperation scenarios.
Actor-critic finds Nash in mean-field games with linear-quadratic costs.
problem Finding Nash equilibrium in mean-field Markov games with linear dynamics and quadratic costs.
method Mean-field actor-critic algorithm with linear function approximation.
result Algorithm converges linearly to Nash equilibrium.
Transformers approximate mean-field dynamics of indistinguishable particles.
problem Approximating the dynamics of indistinguishable particles in complex systems.
method Using transformers to model the mean-field dynamics of interacting particle systems.
result Theoretical bounds on the distance between true and transformer-obtained mean-field dynamics.
Recently, variational approximations such as the mean field approximation have received much interest. We extend the standard mean field method by using an approximating distribution that factorises into cluster potentials. This includes undirected graphs, directed acyclic graphs and junction trees. We derive generaliz…
Mean-field approximations simplify insurance liability calculations.
problem High-dimensional system of equations makes insurance liability calculation infeasible.
method Use mean-field model to replace high-dimensional system with a low-dimensional non-linear system.
result Insurance liability converges to mean-field approximation as cohort size increases.
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.
Improved sampling from mean-field stationary distributions.
problem Sampling from the stationary distribution of mean-field SDEs.
method Decoupling the problem into two aspects: approximation of mean-field SDE and sampling from finite-particle distribution.
result Improved guarantees in various settings, including optimizing neural networks.
Derives mean field game equations from microscopic agent dynamics.
problem Modeling behavior of large interacting agents in games.
method Derives mean field game PDEs from deterministic agent dynamics using Nash equilibria and dynamic programming.
result Derives mean field game limits and scales from agent-based financial market model.
Study policy gradient for large-agent mean-field control and game in continuous time.
problem Optimal policy learning for large number of agents in continuous-time mean-field systems.
method Policy gradient method applied to linear-quadratic mean-field control and game models.
result Policy gradient converges to optimal solution at a linear rate for both mean-field control and game.
Steering Large Agent Populations using Mean-Field Schrodinger Bridges with Gaussian Mixture Modelscs.LG
A new method for steering large agent populations efficiently.
problem Controlling the configuration of a swarm of identical, interacting cooperative agents.
method Mean-Field Schrodinger Bridges with Gaussian Mixture Models.
result A highly efficient parameterization to approximate optimal solutions of the MFSB problem in closed form.
Paper introduces TSSDMN for modeling dynamic multilayer networks.
problem Capturing temporal and cross-layer dynamics in multilayer networks.
method Tensor State Space Model (TSSDMN) using symmetric Tucker decomposition.
result TSSDMN uniquely captures temporal dynamics within and across layers.
Paper proposes a mean-field gradient descent for zero-sum games, proving convergence to Nash equilibrium.
problem Finding mixed Nash equilibria in zero-sum games with multiple players.
method Mean-field gradient descent dynamics with time-averaging, incorporating exponentially discounted gradients.
result Exponential convergence rate to mixed Nash equilibrium with respect to total variation metric.
Study on the smoothness of solutions to a specific type of stochastic differential equation.
problem Regularity of solutions to mean-field -SDEs.
method Analysis of first and second order Fréchet differentiability in the random initial condition.
result Established the Fréchet differentiability of the solution and specified the corresponding equations.
In this paper we study iterative procedures for stationary equilibria in games with large number of players. Most of learning algorithms for games with continuous action spaces are limited to strict contraction best reply maps in which the Banach-Picard iteration converges with geometrical convergence rate. When the be…
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.
Mean field game with defaultable agents and systemic risk quantified.
problem Modeling systemic risk in a financial system with defaultable agents.
method Introduced a mean field game with default, provided an explicit solution, and derived an equation for default probability evolution.
result Systemic risk is described by the evolution of default probability.
Mean Field Portfolio Gamesq-fin.MF
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 algorithm tackles multi-agent reinforcement learning issues.
problem Multi-agent reinforcement learning suffers from the curse of many agents.
method Proposes MF-FQI algorithm based on mean embeddings of distributions.
result Establishes a non-asymptotic analysis for MF-FQI algorithm.
Efficiently reduces tensor ranks using mean-field approximation.
problem Low-rank approximation of non-negative tensors.
method Mean-field approximation of tensor rank reduction.
result Our algorithm achieves faster and competitive tensor rank reduction.
Mean-Field Analysis of Two-Layer Neural Networks: Global Optimality with Linear Convergence Ratescs.LG
This work shows linear convergence for two-layer neural networks in mean-field regime.
problem Optimizing two-layer neural networks in the mean-field regime.
method Mean-field analysis and continuous-time noisy gradient descent.
result Establishes linear convergence rate for two-layer neural networks.