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.

169,051 papers · 148 categories

Trend · papers per month

1.6%3.2%4.7%6.3% · Feb 202319922001200920182026
48 results for external regret

New measure of policy regret shows compatibility with traditional external regret in adversarial games.

problem Incompatibility between traditional and new policy regret measures in adaptive adversaries.
method Revisited policy regret and compared it with external regret; introduced policy equilibrium.
result Policy regret and external regret are compatible in adversarial games.

We introduce CSE for MLSF games and devise online learning algorithms for achieving no-external Stackelberg-regret.

problem Learning equilibrium in leader-follower games with noisy bandit feedback.
method Proposed Correlated Stackelberg Equilibrium (CSE) and online learning algorithms balancing exploration and exploitation.
result Achieves no-external Stackelberg-regret, converging to approximate CSE.

New algorithm reduces online learning regret in uninformed Markov games.

problem Achieving no external regret in uninformed Markov games is impossible.
method Empirical Nash-value regret, parameter-free algorithm, adaptive restart.
result Achieves O(min{K+(CK)1/3,LK})O(\min \{\sqrt{K} + (CK)^{1/3},\sqrt{LK}\}) regret bound.

The paper develops an economic foundation for multi-agent learning in markets.

problem Learning dynamics in markets with strategic externalities.
method A two-phase incentive mechanism that estimates and uses implementable transfers to steer long-run dynamics.
result The mechanism achieves sublinear social-welfare regret and asymptotically optimal welfare under mild rationality and exploration conditions.

In many platforms, user arrivals exhibit a self-reinforcing behavior: future user arrivals are likely to have preferences similar to users who were satisfied in the past. In other words, arrivals exhibit positive externalities. We study multiarmed bandit (MAB) problems with positive externalities. We show that the self…

2018-02-15abs ↗pdf ↗

The paper improves on existing algorithms for minimizing different types of regret in online learning.

problem Minimizing external, internal, and swap regret in online learning with multiple experts.
method Develops a single algorithm using φ-regret minimization and Haar-wavelet-inspired matrix features to achieve optimal bounds in various scenarios.
result Achieves optimal bounds for external, internal, and swap regrets in different expert scenarios.

Study on learning strategies in adaptive Markov games with policy regret as metric.

problem Learning in dynamic Markov games with adaptive opponents is challenging.
method Introduced policy regret as a new learning metric and developed algorithms for consistent adaptive adversaries.
result Achieved T\sqrt{T} policy regret against certain adaptive adversaries.

Paper solves no-swap regret minimization for combinatorial bandits with polylogarithmic dependence on N.

problem Design efficient no-swap regret algorithms for combinatorial bandits with exponentially large action space.
method Introduces a no-swap-regret learning algorithm with polylogarithmic dependence on N and demonstrates efficient implementation.
result Achieves no-swap regret with polylogarithmic dependence on N, resolving an open problem.

We study online learnability of a wide class of problems, extending the results of (Rakhlin, Sridharan, Tewari, 2010) to general notions of performance measure well beyond external regret. Our framework simultaneously captures such well-known notions as internal and general Phi-regret, learning with non-additive global…

2010-11-14abs ↗pdf ↗

New method identifies algo trading strategies as liquidity consumers or providers.

problem Determining if algo trading strategies consume or provide liquidity.
method Analyzes trade and price history to classify strategies as liquidity consumers or providers.
result Identifies net liquidity consumption or provision of algo trading strategies.

Algorithm reduces long-term policy regret in ML decision-making.

problem Capturing long-term impacts of ML decisions in communities.
method Modeling communities as arms in a multi-armed bandit problem, defining policy regret as a stronger metric than external regret.
result Algorithm achieves provably sub-linear policy regret for long time horizons.

Adversarial CBO optimizes under interventions by adversaries and non-stationarities.

problem Optimizing in the presence of adversaries and non-stationary factors.
method Formalizes CBO as ACBO, introduces CBO-MW algorithm combining online learning and causal modeling.
result First algorithm with bounded regret for ACBO, achieving superior performance in synthetic and real-world environments.

The paper tackles online learning with two types of losses and shows it's impossible without certain assumptions.

problem Online learning with primary and secondary losses where the secondary loss is bounded by a linear threshold.
method Analyzes the feasibility of achieving low regret with respect to the primary loss while keeping the secondary loss within a linear threshold.
result Achieving the goal is impossible without bounded variance assumption on the secondary loss.

Online L2D algorithm for multiclass classification with varying experts.

problem Handling streaming data, changing expert availability, and shifting expert distribution.
method First online L2D algorithm with O((n+ne)T2/3)O((n+n_e)T^{2/3}) and O((n+ne)T)O((n+n_e)\sqrt{T}) regret guarantees.
result Effective extension of standard L2D to settings with varying expert availability and reliability.

New learning dynamics achieve fast convergence in games without needing to know utility scales.

problem Fast convergence guarantees in learning games require prior knowledge of utility scales.
method Developed scale-free and scale-invariant learning dynamics using optimistic follow-the-regularized-leader with adaptive learning rates and clipping techniques.
result Achieved fast convergence rates to Nash and correlated equilibria without prior utility scale knowledge.

The paper tackles ride-hailing fleet repositioning with a calibrated demand approach.

problem Repositioning idle supply before future demand is observed in ride-hailing.
method A predict-then-optimize approach using calibrated demand regimes, a similarity gate, and spatial queue-regret decomposition.
result The spatial gate reduces mean wait time to 82.3s compared to 85.3s for a hand-tuned similarity gate and 85.8s for a distributional-only baseline.

Bayesian inference reconstructs external potentials in DFT for many-particle systems.

problem Reconstructing external potentials in classical density-functional theory (DFT) for many-particle systems.
method Combines Bayesian inference with classical DFT to probabilistically reconstruct external potentials.
result Accurately infers external potentials and density profiles with uncertainty quantification.

Proposes a method to use external machine-learning predictions in multinomial logistic regression.

problem Improving statistical inference using summary-level external machine-learning predictions.
method Empirical-likelihood framework incorporating moment constraints from external nonparametric machine-learning predictions.
result Fused estimator achieves strict efficiency gain over primary-only estimator under mild conditions.

In recent years, constrained optimization has become increasingly relevant to the machine learning community, with applications including Neyman-Pearson classification, robust optimization, and fair machine learning. A natural approach to constrained optimization is to optimize the Lagrangian, but this is not guarantee…

2018-04-17abs ↗pdf ↗

New estimator improves ATT estimation efficiency with external controls.

problem Reduced efficiency when incorporating external controls into ATT estimation.
method Proposes a novel doubly robust estimator for ATT that maintains higher efficiency than standard approaches.
result Demonstrates improved efficiency of the new estimator compared to standard approaches, even under model misspecification.

Method estimates model performance on external samples from limited statistical characteristics.

problem Limited access to multiple datasets due to privacy and commercial restrictions.
method Search for weights that match external statistics and are closest to uniform, using model performance on weighted internal sample as an estimation.
result Estimated external performance is closer to actual performance than internal performance.

The study assesses external validity by evaluating worst-case treatment effects across subpopulations.

problem Underrepresentation of marginalized groups and limited study populations.
method Develops a semiparametrically efficient estimator for worst-case treatment effects (WTE) and uses cross-fitting to guard against brittle findings.
result The proposed framework guards against invalid findings due to unanticipated population shifts.

A method for logistic regression inference using both internal and external data.

problem Inability to estimate intercept and marginal case proportion in case-control logistic regression.
method Empirical likelihood approach integrating internal and external data.
result Intercept parameter becomes identifiable with external information, and all parameters are estimable consistently.

Study examines remittances in Nepal, linking external demand and domestic monetary conditions.

problem Understanding the dynamics of remittances in Nepal's economy.
method Constructed composite indices via PCA for external demand and domestic monetary conditions. Used ARDL, cointegration, DOLS, ECM, and machine learning for analysis.
result Strong positive long-run effect of external demand on remittances, significant negative impact of tighter domestic monetary conditions.

New learning dynamics adapt to corrupted games, improving performance in real-world scenarios.

problem Learning dynamics in games are limited to honest players, ignoring real-world corruption.
method Adaptive learning dynamics that adapt to player deviations from prescribed algorithms.
result Learning dynamics achieve better performance in corrupted games, matching honest regime bounds.

Framework for estimating treatment effects using external control data.

problem Improving efficiency in estimating average treatment effects (ATE) in hybrid trials.
method Developed a formal causal inference framework based on exchangeability assumptions and graphical criteria. Proposed estimators and efficient doubly-robust methods.
result Established finite-sample performance and demonstrated application to spinal muscular atrophy trial.

Algorithm learns RBMs with arbitrary external fields, improving on previous constraints.

problem Learning RBMs with arbitrary external fields, improving on previous constraints.
method Greedy algorithm that maximizes covariance between observed nodes sharing latent neighbors.
result Algorithm can learn RBMs with arbitrary external fields, improving on previous constraints.

Study identifies negative data externalities affecting model performance on specific groups.

problem Negative data externalities on group performance in machine learning models.
method Characterized and detected data-model inefficiencies, focusing on specific types of externalities.
result Negative data externalities can lower model performance on specific sub-groups, even with larger datasets.

Survey of methods to incorporate external knowledge into stock price prediction.

problem Challenges in predicting stock prices due to market volatility and non-linearity.
method Survey of methods for acquiring and incorporating external knowledge into stock price prediction models.
result Systematic synthesis of previous studies on external knowledge types and their application in stock price prediction.

Estimates non-parametric logistic model using case-control data and external summary info.

problem Imbalanced binary data in case-control studies.
method Two-step estimation procedure with deep neural network for functional approximation.
result Proposed estimator achieves optimal convergence rate in non-parametric regression.

The importance of nodes in a network constantly fluctuates based on changes in the network structure as well as changes in external interest. We propose an evolving teleportation adaptation of the PageRank method to capture how changes in external interest influence the importance of a node. This framework seamlessly g…

2012-03-27abs ↗pdf ↗

UAMM uses external market prices to improve AMM efficiency and reduce liquidity provider risk.

problem Traditional AMMs lack consideration of external markets and risk management.
method UAMM calculates prices by incorporating external market prices and impermanent loss, maintaining constant product curve properties.
result UAMM eliminates arbitrage opportunities when external market prices are efficient, reducing liquidity provider risk.

Enhances clustering by using external categorical data.

problem Improving clustering outcomes using external categorical evidence.
method Evidence transfer method that manipulates autoencoder latent representations based on external categorical data.
result Our method effectively manipulates latent representations with real evidence and remains robust with low quality evidence.