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

6481,2971,9452,593 · Jun 202019922001200920172026
48 results for continuum of agents

Optimal reinsurance contracts designed for a continuum of risk types.

problem Designing optimal reinsurance contracts with a continuum of risk types.
method Principal-agent model, VaR at risk tolerance level, change of variables, univariate approach.
result Optimal reinsurance contracts are in stop-loss form, classifying agents into high and low risk groups.

Generalizes risk sharing models to a continuum of agents.

problem Risk sharing among a large number of heterogeneous agents.
method Modeling agents as points in a measure space, using risk measures on a probability space, and deriving dual representations.
result Explicit formulas for specific risk measures (entropic and expected shortfall) and applications to Pareto efficiency.

Optimal strategy proposed for maximizing cumulative reward in continuum-armed bandits.

problem Maximizing cumulative reward in a scenario with limited resources and unknown stochastic rewards.
method Proposed an optimal strategy for a nonparametric setting with side information on actions.
result Optimal regret scales as \(O(T^{1/3})\) up to poly-logarithmic factors when \(T\) is proportional to \(N\).

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 ↗

We consider a distributed learning setup where a network of agents sequentially access realizations of a set of random variables with unknown distributions. The network objective is to find a parametrized distribution that best describes their joint observations in the sense of the Kullback-Leibler divergence. Apart fr…

2016-05-06abs ↗pdf ↗

Study optimal investment in large populations of competitive, heterogeneous agents.

problem Maximizing utility in a large, interacting agent system with relative performance concerns.
method Analyzes stochastic utility maximization game in finite and infinite agent settings, using graphon models and backward stochastic differential equations.
result Convergence of Nash equilibria and optimal utilities from finite to infinite agent models under specific conditions.

Optimal risk sharing without convex preferences using aggregate convexity.

problem Risk sharing among non-convex preferences.
method Aggregate convexity principles and Lyapunov convexity, combined with approximation arguments for law invariant risk measures.
result Derivation of a computationally tractable formula for the conjugate of the value function.

In this paper we study the continuum time dynamics of a stock in a market where agents behavior is modeled by a Minority Game and a Grand Canonical Minority Game. The dynamics derived is a generalized geometric Brownian motion; from the Black & Scholes formula the calibration of both the Minority Game and the Grand Can…

2012-05-11abs ↗pdf ↗

Smooth knots can be embedded into a specific Menger continuum.

problem Embedding smooth knots into a specific type of continuum.
method Explicit construction using cubical models and self-similarity of the Menger continuum.
result Every smooth knot can be isotoped into the Menger continuum.

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.

We prove the following result announced in Todorov and Valov: Any homogeneous, metric ANRANR-continuum is a VGnV^n_G-continuum provided dimGX=n1\dim_GX=n\geq 1 and Hˇn(X;G)0\check{H}^n(X;G)\neq 0, where GG is a principal ideal domain. This implies that any homogeneous nn-dimensional metric ANRANR-continuum with $\check{H}^n(X;G)\neq…

2012-08-31abs ↗pdf ↗

We introduce the continuum self-similar tree (CSST) and characterize it topologically. We apply this to answer a question of Curien about the topology of the continuum random tree (CRT). We also give a topological characterization of other trees with branch points of finite or infinite valences.

2018-03-26abs ↗pdf ↗

Study optimal portfolios for many players in a market model with random coefficients.

problem Optimal portfolio selection for many players under relative performance criteria in a market model with random coefficients.
method Game theory and stochastic optimal control, focusing on CARA and CRRA risk preferences, and extending to continuum of players.
result Existence of forward Nash equilibrium and mean field equilibrium for the n-agent game and corresponding mean field stochastic optimal control problem.

Expands MFGs to handle real-world asymmetric multi-agent games efficiently.

problem Applying mean-field games to real-world, heterogeneous multi-agent systems.
method Develops a method to symmetrize and extend finite-player games to infinite-player MFGs, proving approximation bounds and convergence guarantees.
result TD learning converges to approximate Nash equilibria in finite-sample settings, enabling symmetrized learning without explicit MFG models.

Continuum Dropout improves neural differential equations by preventing overfitting.

problem Overfitting in Neural Differential Equations (NDEs).
method Introduces Continuum Dropout, a regularization technique based on alternating renewal processes.
result Continuum Dropout outperforms existing methods in various tasks, improving generalization and uncertainty quantification.

Dimension reduction of multivariate data supervised by auxiliary information is considered. A series of basis for dimension reduction is obtained as minimizers of a novel criterion. The proposed method is akin to continuum regression, and the resulting basis is called continuum directions. With a presence of binary sup…

2016-06-20abs ↗pdf ↗

Derives continuum model from discrete ε\varepsilon-graphs with connectivity functional.

problem Modeling diffusion in networks with varying connectivity.
method Energy-based continuum limit derivation, neural-network reconstruction of connectivity.
result Error between discrete and continuum energies is O(ε)O(\varepsilon), valid even with fluctuations.

An important question that discrete approaches to quantum gravity must address is how continuum features of spacetime can be recovered from the discrete substructure. Here, we examine this question within the causal set approach to quantum gravity, where the substructure replacing the spacetime continuum is a locally f…

2006-04-28abs ↗pdf ↗

Generalizes Alexandroff's VnV^n-continua to cohomological dimensions.

problem Extending Alexandroff's concept of VnV^n-continua to cohomological dimensions.
method Proves that strongly locally homogeneous generalized continua with cohomological dimension nn are generalized VnV^n-spaces.
result Every strongly locally homogeneous continuum of covering dimension nn is a VnV^n-continuum in the sense of Alexandroff.

Proves continuum limits of Lipschitz learning using Γ-convergence.

problem Semi-supervised learning with graph-based methods and continuum limits of pp-Laplacian learning.
method Proves continuum limits of Lipschitz learning using Γ-convergence.
result Proves ΓΓ-convergence in the LL^\infty-topology to the supremum norm of the gradient.

This paper studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.

problem Optimizing an unknown function with limited evaluations.
method Studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.
result Minimax rates over Besov spaces are identical to those over the smallest Hölder space into which Besov spaces embed.

A mesh-free method solves continuum-marginal optimal transport problems.

problem Recovering minimum-energy velocity fields from time-continuous probability marginals.
method Embeds weak continuity equation in a reproducing kernel Hilbert space, optimizing with mini-batch stochastic methods.
result Accurately recovers drift and maintains marginal consistency in synthetic experiments.

The paper analyzes optimal investment strategies in a game with jump risk, deriving mean field equilibria.

problem Optimal investment strategies in a game with jump risk and peer competition.
method Formulated mean field game and n-player game models, characterized equilibrium states, and derived approximation errors.
result Explicit mean field equilibrium and approximate Nash equilibrium for large n-player games.

We characterize those planar Peano continua that are homotopy equivalent to 1-dimensional sets. While many planar Peano continua are not homotopically 1-dimensional, we prove that each has fundamental group that embeds in the fundamental group of a 1-dimensional planar Peano continuum. We leave open the following quest…

2006-03-03abs ↗pdf ↗

This work proves the continuum limit of t-SNE for data visualization.

problem Understanding the theoretical basis of t-SNE from a continuum limit perspective.
method Proving the Kullback-Leibler divergence consistency as non o \infty for t-SNE.
result The continuum variational problem involving non-convex gradient regularization and penalty on probability density function magnitude.

In this paper the problem of optimal derivative design, profit maximization and risk minimization under adverse selection when multiple agencies compete for the business of a continuum of heterogenous agents is studied. The presence of ties in the agents' best-response correspondences yields discontinuous payoff functi…

2011-07-05abs ↗pdf ↗

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.

Continuum transformers learn operators in context via gradient descent.

problem Generalizing transformers to handle infinite-dimensional inputs for in-context learning.
method Gradient descent in an operator RKHS, leveraging generalized representer theorems and gradient flows.
result Operator learned in context is Bayes Optimal Predictor in infinite depth limit.

Study many-player investment-consumption games with power FPPs, finding market-risk preference affects consumption.

problem Investment and consumption optimization in a mean field competition setting.
method Solve many-player and mean field games using power FPPs, providing closed-form solutions.
result Market-risk relative consumption preference affects agent's consumption decisions.

We show how to associate an R-tree to the set of cut points of a continuum. If X is a continuum without cut points we show how to associate an R-tree to the set of cut pairs of X.

2009-05-15abs ↗pdf ↗

Continuum-wise hyperbolicity is exactly the pseudo-Anosov dynamics with spine singularities.

problem Classification of continuum-wise hyperbolic surface homeomorphisms
method Proving a complete structural classification
result Every cwF_F-hyperbolic homeomorphism is pseudo-Anosov with spine singularities

This paper establishes the consistency of spectral approaches to data clustering. We consider clustering of point clouds obtained as samples of a ground-truth measure. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. We investigate the…

2015-08-08abs ↗pdf ↗

We analyze convergence of Fermat distances and their application in clustering.

problem Understanding convergence properties of Fermat distances on Riemannian manifolds.
method Geometric and statistical arguments in percolation theory, leveraging novel arguments for non-uniform densities and curved domains.
result Discrete, sample-based Fermat distances converge to their continuum analogues with a precise rate dependent on intrinsic dimensionality.

We introduce a concept of tree-graded metric space and we use it to show quasi-isometry invariance of certain classes of relatively hyperbolic groups, to obtain a characterization of relatively hyperbolic groups in terms of their asymptotic cones, to find geometric properties of Cayley graphs of relatively hyperbolic g…

2004-05-03abs ↗pdf ↗

Framework learns physics-informed continuum models from molecular data.

problem Discovering accurate and robust data-driven continuum models from molecular simulation data.
method Operator regression framework using neural networks in modal space with physical inductive biases.
result Learned operators generalize to unseen system characteristics.

We construct a functor AC(,)AC(-,-) from the category of path connected spaces XX with a base point xx to the category of simply connected spaces. The following are the main results of the paper: (i) If XX is a Peano continuum then AC(X,x)AC(X,x) is a cell-like Peano continuum; (ii) If XX is nn-dimensional then AC(X,x)AC(X, x)

2013-02-17abs ↗pdf ↗

Study of convergence of point-object configurations to a charged dust continuum.

problem Understanding the convergence of discretized point-object configurations to a charged dust continuum.
method Establishing existence and uniqueness of horizons/minimal surfaces, studying geometries of regions exterior to minimal surfaces, and discussing limits.
result Examples of scalar curvature jumps upon taking Gromov-Hausdorff and intrinsic flat limits.