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

77154230307 · May 202619922001200920172026
48 results for vector-valued finite game

New approach for adaptive conformal inference using Blackwell's theory.

problem Non-exchangeable environments in sequential conformal inference.
method Reinterpretation of ACI as a game, construction of coverage and efficiency objectives, approachability strategy.
result Algorithm achieves strong theoretical guarantees and practical insights.

Financial markets are often driven by latent factors which traders cannot observe. Here, we address an algorithmic trading problem with collections of heterogeneous agents who aim to perform optimal execution or statistical arbitrage, where all agents filter the latent states of the world, and their trading actions hav…

2018-03-12abs ↗pdf ↗

Even when confronted with the same data, agents often disagree on a model of the real-world. Here, we address the question of how interacting heterogenous agents, who disagree on what model the real-world follows, optimize their trading actions. The market has latent factors that drive prices, and agents account for th…

2018-10-14abs ↗pdf ↗

Boosting framework for vector-valued prediction with geometric stability.

problem Lack of a general theoretical understanding of aggregation for structured prediction.
method Identifies (α,β)(α,β)-stability property and proposes a boosting framework based on exponential reweighting and geometric-median aggregation.
result Obtains exponential decay of empirical divergence error under weak learner condition and (α,β)(α,β)-stability.

Study confirms learning rates for vector-valued spectral algorithms, proving consistency.

problem Theoretical confirmation of learning rates for vector-valued spectral algorithms.
method Rigorous analysis of learning rates for various vector-valued spectral algorithms, including kernel ridge regression and gradient descent.
result Upper and lower bounds on learning rates for vector-valued spectral algorithms, proving minimax optimality in various scenarios.

The paper extends consistency results for sequential design strategies to vector-valued Gaussian processes.

problem Estimating excursion sets of vector-valued Gaussian processes.
method Clarifying the connection between continuous Gaussian processes and Gaussian measures in Banach spaces, extending concepts and properties from scalar-valued settings to vector-valued settings.
result Consistency results for sequential design strategies can be applied to vector-valued Gaussian processes.

Paper analyzes error bounds for learning with vector-valued RF, improving existing analyses.

problem Learning with vector-valued random features in infinite-dimensional settings.
method Direct analysis of risk functional, avoiding random matrix theory.
result Strong consistency and minimax optimal convergence rates established.

Develops vector-valued RKBS for neural networks and operators.

problem Understanding function spaces of Rd\mathbb{R}^d-valued neural networks and neural operators.
method Defines and constructs vector-valued RKBS (vv-RKBS) without restrictive assumptions.
result Establishes Representer Theorem for neural architectures.

We examine the relationship between nonabelian Hodge theory for Riemann surfaces and the theory of vector valued modular forms. In particular, we explain how one might use this relationship to prove a conjectural three-term inequality on the weights of free bases of vector valued modular forms associated to complex, fi…

2018-12-14abs ↗pdf ↗

DORIS algorithm achieves no-regret learning in Markov games with adversarial opponents.

problem Decentralized policy learning in Markov games with nonstationary opponents.
method DORIS algorithm using optimistic hyperpolicy mirror descent.
result Achieves K\sqrt{K}-regret in general function approximation.

The paper simplifies multi-agent RL dynamics in finite-state Markov games using homogenization.

problem Approximating complex multi-agent reinforcement learning dynamics in finite-state Markov games.
method Rescaling learning process by reducing learning rate and increasing update frequency, proving convergence to an ODE.
result The rescaled process converges to an ODE that approximates the agent's learning dynamics.

In this paper, we consider multi-agent learning via online gradient descent in a class of games called λλ-cocoercive games, a fairly broad class of games that admits many Nash equilibria and that properly includes unconstrained strongly monotone games. We characterize the finite-time last-iterate convergence rate for …

2020-02-23abs ↗pdf ↗

Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss and receives a feedback signal, both of which are fixed functions of the action a…

2011-02-10abs ↗pdf ↗

A new method uses Mean Field Games to optimize mixture models of Bernoulli and categorical distributions.

problem Optimizing parameters of finite mixture models of Bernoulli and categorical distributions.
method Mean Field Games theory applied to multi-population systems.
result The Mean Field Games approach provides a method to compute mixture model parameters.

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.

Optimal rates for vector-valued regression on various norms.

problem Optimal rates for vector-valued ridge regression on continuous norms.
method Combining standard capacity assumptions with tensor product constructions of vector-valued interpolation spaces.
result Optimal rates for vector-valued ridge regression, independent of output space dimension.

We discuss a natural game of competition and solve the corresponding mean field game with \emph{common noise} when agents' rewards are \emph{rank dependent}. We use this solution to provide an approximate Nash equilibrium for the finite player game and obtain the rate of convergence.

2016-03-21abs ↗pdf ↗

The space of vector-valued forms on any manifold is a graded Lie algebra with respect to the Frolicher-Nijenhuis bracket. In this paper we consider multiplicative vector-valued forms on Lie groupoids and show that they naturally form a graded Lie subalgebra. Along the way, we discuss various examples and different char…

2017-06-02abs ↗pdf ↗

Vector-valued learning, where the output space admits a vector-valued structure, is an important problem that covers a broad family of important domains, e.g. multi-task learning and transfer learning. Using local Rademacher complexity and unlabeled data, we derive novel semi-supervised excess risk bounds for general v…

2019-09-11abs ↗pdf ↗

The existence of stationary Markov perfect equilibria in stochastic games is shown under a general condition called "(decomposable) coarser transition kernels". This result covers various earlier existence results on correlated equilibria, noisy stochastic games, stochastic games with finite actions and state-independe…

2013-11-07abs ↗pdf ↗

The paper proposes methods to find a shared active subspace for multivariate vector-valued functions.

problem Minimizing the deviation between function evaluations in the original and reconstructed spaces.
method Manipulating gradients or SPD matrices to identify a shared structure.
result Summing SPD matrices often identifies the best shared active subspace.

New algorithms optimize multiple tasks with shared similarities, reducing regret.

problem Optimizing multiple objectives with shared similarities in non-parametric Bayesian optimization.
method Developed two novel BO algorithms using multi-task kernels and random scalarizations.
result Derived worst-case regret bounds capturing inter-task similarities.

Optimal transport for vector Gaussian mixtures improves efficiency and structure preservation.

problem Optimal mass transport for vector-valued Gaussian mixtures.
method Vectorizing Gaussian mixture models and studying optimal mass transport problems.
result Computational efficiency and structure preservation in optimal mass transport.

We present a framework to derive risk bounds for vector-valued learning with a broad class of feature maps and loss functions. Multi-task learning and one-vs-all multi-category learning are treated as examples. We discuss in detail vector-valued functions with one hidden layer, and demonstrate that the conditions under…

2016-06-05abs ↗pdf ↗

Novel approach to Nash equilibrium in mean-field stochastic games with operator resolvents.

problem Finding Nash equilibrium in mean-field stochastic games with mean-field interaction.
method Proposed a novel approach to derive Nash equilibrium semi-explicitly using operator resolvents and stochastic Fredholm equations.
result Equilibrium of the NN-player game converges to mean-field equilibrium, and ε\varepsilon-Nash equilibrium derived as a by-product.

Game theory models how agents trade in a risky asset considering price impact and a common signal.

problem Modeling how financial agents liquidate assets in a risky market with price impact and a common signal.
method Formulated and solved a multi-player stochastic differential game and mean field game.
result Equilibrium strategies reveal how agents adjust the predictive trading signal to price impact.

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.

Study best-response learning dynamics in zero-sum polymatrix games under full and minimal information settings.

problem Learning dynamics in zero-sum polymatrix games under different information settings.
method Two-timescale learning dynamics combining smoothed best-response updates and TD-learning for estimating local payoff functions.
result Polynomial-time finite-sample guarantees for convergence to an ε-Nash equilibrium in the minimal information case.

Study improves self-normalized bounds for vector-valued processes beyond sub-Gaussianity.

problem Limited understanding of self-normalized concentration for vector-valued processes outside sub-Gaussian frameworks.
method Developed concentration inequalities for self-normalized processes with light tails (e.g., Bennett, Bernstein bounds) for vector-valued data.
result Provided new insights and bounds for self-normalized processes with non-sub-Gaussian distributions.

This paper uses recent results on continuous-time finite-horizon optimal switching problems with negative switching costs to prove the existence of a saddle point in an optimal stopping (Dynkin) game. Sufficient conditions for the game's value to be continuous with respect to the time horizon are obtained using recent …

2014-11-17abs ↗pdf ↗

We approximate derivatives of functions on manifolds by embedding them and applying vector-valued operators.

problem Derivatives of manifold-valued functions are harder to approximate than vector-valued functions.
method Embed the manifold into a higher space, approximate the derivative of the vector-valued function, and project back.
result We provide error bounds for the approximation of manifold-valued function derivatives.

Paper introduces vector-valued variation spaces for multi-output neural networks.

problem Understanding and optimizing multi-output neural networks.
method Development of vector-valued variation spaces and representer theorem.
result Novel bounds for layer widths in deep networks and a convex optimization method for compression.