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

55110165220 · Jun 202019922001200920172026
48 results for Hölder equilibrium probabilities

Adversarial online nonparametric regression achieves optimal rates with locally adaptive learning.

problem Adversarial online nonparametric regression with general convex losses.
method Parameter-free learning algorithm leveraging chaining trees to compete against H{ö}lder functions, dynamically tracking and adapting to local smoothness variations.
result First computationally efficient algorithm with locally adaptive optimal rates for online regression in an adversarial setting.

General equilibrium equations in economics play the same role with many-body Newtonian equations in physics. Accordingly, each solution of the general equilibrium equations can be regarded as a possible microstate of the economic system. Since Arrow's Impossibility Theorem and Rawls' principle of social fairness will p…

2015-05-22abs ↗pdf ↗

Investigates portfolio selection for rank-dependent utilities in incomplete markets.

problem Portfolio selection for agents with rank-dependent utility in incomplete financial markets.
method Characterizes deterministic strict equilibrium strategies for constant-coefficient and time-invariant probability weighting functions. Addresses the issue of selecting an optimal strategy from multiple equilibrium strategies for time-variant probability weighting functions.
result Characterizes deterministic strict equilibrium strategies and identifies optimal strategies from multiple equilibrium strategies.

The study explores geodesics and KL-divergence on Hölder equilibrium probabilities.

problem Finding the probability that minimizes KL-divergence from a fixed probability in a convex set of probabilities.
method Analyzes geodesics paths on the manifold of Hölder equilibrium probabilities and uses KL-divergence as a metric.
result Explicit equations for the solution of the minimization problem are derived.

This paper develops a dynamic equilibrium model where agents exhibit a strong form of belief heterogeneity: they disagree about zero probability events. It is shown that, somewhat surprisingly, equilibrium exists in this setting, and that the disagreement about nullsets naturally leads to equilibrium asset pricing bubb…

2013-06-21abs ↗pdf ↗

Discovery of atomistic systems with desirable properties is a major challenge in chemistry and material science. Here we introduce a novel, autoregressive, convolutional deep neural network architecture that generates molecular equilibrium structures by sequentially placing atoms in three-dimensional space. The model e…

2018-10-26abs ↗pdf ↗

Study on stock price formation on trees with multi-population and non-rational agents.

problem Equilibrium price formation for risky stock with multi-population and non-rational agents.
method Combining mean-field game theory with binomial tree framework, proving existence of unique equilibrium, deriving explicit formula for transition probabilities.
result Existence of unique mean-field market-clearing equilibrium with explicit analytic formula for stock price transition probabilities.

General lower bounds on neural network approximation in L^p norm.

problem Fundamental limits of neural network expressivity.
method General lower bound proof on approximation in L^p norm, applied to feed-forward neural networks.
result Neural networks can't approximate certain functions as well as previously thought.

Model predicts default risk based on company's financial forecasts and credit conditions.

problem Estimating the risk of a company defaulting on its financial obligations.
method Developed an equilibrium model linking interest rates to corporate performance and credit supply.
result Estimates idiosyncratic default risk and provides forward-looking probability of default (PD).

PAPAL algorithm finds mixed Nash equilibria in continuous games.

problem Finding mixed Nash equilibria in non-convex, non-concave games.
method Particle-based Primal-Dual Algorithm (PAPAL) for weakly entropy-regularized min-max optimization.
result PAPAL offers non-asymptotic convergence guarantees for εε-mixed Nash equilibrium.

We argue that the existing regret matchings for Nash equilibrium approximation conduct "jumpy" strategy updating when the probabilities of future plays are set to be proportional to positive regret measures. We propose a geometrical regret matching which features "smooth" strategy updating. Our approach is simple, intu…

2019-08-18abs ↗pdf ↗

Study on convergence of Langevin dynamics for zero-sum games in probability distributions.

problem Analyzing convergence of Langevin dynamics for zero-sum games in probability distributions.
method Proved exponential and biased convergence guarantees for mean-field and finite-particle min-max Langevin dynamics.
result Explicit iteration complexity for finite-particle algorithms to approximate equilibrium distributions.

Paper proves convergence of Gini index to equilibrium in Wasserstein distance.

problem Proving convergence of Gini index to equilibrium in Wasserstein distance.
method Analyzes Gini index as Lyapunov functional and proves convergence in Wasserstein distance.
result Proves convergence of Gini index to equilibrium in Wasserstein distance.

In the context of stochastic continuum-armed bandits, we present an algorithm that adapts to the unknown smoothness of the objective function. We exhibit and compute a polynomial cost of adaptation to the H{ö}lder regularity for regret minimization. To do this, we first reconsider the recent lower bound of Locatelli an…

2019-05-24abs ↗pdf ↗

Study of random sections on complex spaces converging to equilibrium metrics.

problem Understanding the behavior of random holomorphic sections on complex spaces.
method Analyzing the convergence of normalized Fubini-Study currents and integration currents to the equilibrium metric's curvature.
result The normalized currents of integration along zero divisors converge almost surely to the curvature current of the equilibrium metric.

Study of 2imes22 imes 2 zero-sum games with noisy observations and commitments.

problem Analyzing 2imes22 imes 2 zero-sum games with noisy observations and commitments.
method Modeling a 2imes22 imes 2 zero-sum game with a leader committing to a strategy and a follower observing a noisy version of the leader's action.
result Observing the leader's action is either beneficial or immaterial for the follower, and the equilibrium payoff is bounded.

The large majority of risk-sharing transactions involve few agents, each of whom can heavily influence the structure and the prices of securities. This paper proposes a game where agents' strategic sets consist of all possible sharing securities and pricing kernels that are consistent with Arrow-Debreu sharing rules. F…

2014-12-13abs ↗pdf ↗

Proves minimax sample complexity for turn-based stochastic games.

problem Proving theoretical guarantees for reinforcement learning in turn-based stochastic games.
method Developing absorbing TBSG and reward perturbation techniques to handle statistical dependence.
result Empirical Nash equilibrium strategy approximates true Nash equilibrium in turn-based stochastic games.

We study finite energy classes of quasiplurisubharmonic (qpsh) functions in the setting of toric compact K{ä}hler manifolds. We characterize toric qpsh functions and give necessary and sufficient conditions for them to have finite (weighted) energy, both in terms of the associated convex function in R n , and through t…

2018-04-10abs ↗pdf ↗

We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend on the amount wagered on those outcomes. By varying the `reality map', which rel…

2009-02-01abs ↗pdf ↗

Paper studies zero-sum games with noisy observations and identifies equilibrium conditions.

problem Zero-sum games with noisy observations of the leader's actions.
method Analyzes the equilibrium of games with noisy action observability, identifies necessary conditions for uniqueness, and investigates the cardinality of best responses.
result The noisy observations significantly impact the cardinality of the follower's set of best responses, and under certain conditions, this set becomes a singleton almost surely.

Optimization methods are used to determine equilibria of investment in cryptocurrencies. The basic assumptions involve existence of a core group (the "wealthy") that fears the loss of substantial assets through government seizure. Speculators constitute another group that tends to introduce volatility and risk for the …

2018-05-25abs ↗pdf ↗

The paper develops a new algorithm for constructing minimax estimators using online learning techniques.

problem Designing minimax estimators for probability distribution parameters.
method Viewing the problem as a zero-sum game and using online learning with non-convex losses to find a Nash equilibrium.
result The algorithm constructs both a minimax estimator and a least favorable prior.

The paper solves portfolio selection for complex preferences in continuous time.

problem Dynamic portfolio selection for nonlinear preferences with time inconsistency.
method Stochastic maximum principle and verification theorems for equilibrium strategies.
result Equilibrium strategies derived in closed form for CRRA and CARA preferences.

Investment strategies for rank-dependent utility agents are derived in a continuous-time market.

problem Time inconsistency in rank-dependent utility models.
method Study of consistent planners seeking intra-personal equilibrium strategies.
result Explicit final wealth profile replicating equilibrium strategies, with scaling function derived.

Let SS be a closed oriented surface of genus at least 22, and denote by T(S)\mathcal{T}(S) its Teichm{ü}ller space. For any isotopy class of closed curves γγ, we compute the first three derivatives of the length function _γ:T(S)R_+\ell\_γ:\mathcal{T}(S)\rightarrow\mathbf{R}\_+ in the shearing coordinates associated to a maxim…

2015-06-22abs ↗pdf ↗

New bounds on trajectory safety in training models with Langevin Dynamics.

problem Bounding the probability of a model's trajectory staying away from a designated failure region.
method Analyzes Langevin dynamics on smooth, strongly convex loss landscapes, introducing shape-free and local relaxation bounds.
result The in-set probability relaxes to the static value after a burn-in time of order d, using only the global spectral gap of the loss.

We consider the problem of online nonparametric regression with arbitrary deterministic sequences. Using ideas from the chaining technique, we design an algorithm that achieves a Dudley-type regret bound similar to the one obtained in a non-constructive fashion by Rakhlin and Sridharan (2014). Our regret bound is expre…

2015-02-26abs ↗pdf ↗

We study the Immediate Exchange model, recently introduced by Heinsalu and Patriarca [Eur. Phys. J. B 87: 170 (2014)], who showed by simulations that the wealth distribution in this model converges to a Gamma distribution with shape parameter 22. Here we justify this conclusion analytically, in the infinite-population…

2014-09-23abs ↗pdf ↗

New algorithm for solving minimax problems over distributions converges to Nash equilibrium.

problem Solving minimax problems over probability distributions.
method Symmetric Mean-field Langevin Dynamics (MFL-AG and MFL-ABR) with weighted averaging and best response dynamics.
result Converges to mixed Nash equilibrium with average-iterate and last-iterate convergence.

Validates economic scenarios using statistical tests on stochastic processes.

problem Ensuring the accuracy of real-world economic scenario models.
method Applies Chevyrev and Oberhauser's (2022) signature and maximum mean distance test to various stochastic processes.
result Demonstrates the test's effectiveness across different path properties relevant to financial modeling.

We propose an analytically tractable variation of the minority game in which rational agents use probabilistic strategies. In our model, NN agents choose between two alternatives repeatedly, and those who are in the minority get a pay-off 1, others zero. The agents optimize the expectation value of their discounted fu…

2012-12-29abs ↗pdf ↗

Study optimizes interbank lending and borrowing to reduce systemic risk.

problem Optimizing lending and borrowing in interbank markets to mitigate systemic risk.
method Risk-sensitive mean field games with common noise, convex analysis, Fokker-Planck equations, first hitting time method.
result Risk-averse behavior reduces individual and systemic bank risks.

The paper models insurance market dynamics under uncertainty and financial frictions.

problem Modeling insurer behavior under uncertainty and financial frictions.
method Dynamic equilibrium model of insurance market with competitive insurers maximizing shareholder value.
result Investment can lead to lower insurance prices and negative loadings under certain conditions.