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

55111166221 · May 202619922001200920172026
48 results for risk feedback

Algometrics analyzes how predictive models affect their own forecasts in algorithmic markets.

problem How predictive models affect their own forecasts in algorithmic markets.
method Introduces algometrics, a framework for time series with feedback, proving three results on deployment risk.
result Deployment risk cannot be identified from passive historical data alone, and historical rankings can invert under crowding.

We develop a learning principle and an efficient algorithm for batch learning from logged bandit feedback. This learning setting is ubiquitous in online systems (e.g., ad placement, web search, recommendation), where an algorithm makes a prediction (e.g., ad ranking) for a given input (e.g., query) and observes bandit …

2015-02-09abs ↗pdf ↗

The paper addresses learner privacy in convex optimization with feedback.

problem Privacy risks from eavesdropping adversaries observing learner's queries.
method Optimally obfuscating learner's queries to make their learned optimal value hard to estimate.
result Query complexity overhead is additive in LL in the minimax formulation, multiplicative in LL in the Bayesian formulation.

SetRank tackles collaborative ranking from implicit feedback using setwise Bayesian approach.

problem Challenges in pairwise and listwise approaches for implicit feedback.
method SetRank is a novel setwise Bayesian approach that accommodates implicit feedback characteristics.
result SetRank outperforms state-of-the-art baselines on real-world datasets.

Paper studies CLO with partial feedback, improving decision-making in uncertain contexts.

problem Improving decision-making in contexts with uncertain cost coefficients using partial feedback.
method Unified class of offline learning algorithms for CLO with different types of feedback, using IERM framework.
result Fast-rate regret bound for IERM with partial feedback and misspecified model classes.

A simple quantitative example of a reflexive feedback process and the resulting price dynamics after an exogenous price shock to a financial network is presented. Furthermore, an outline of a theory that connects financial reflexivity, which stems from cross-ownership and delayed or incomplete information, and no-arbit…

2013-01-27abs ↗pdf ↗

Proposes a method to train classifiers with delayed feedback using a time window.

problem Training classifiers with delayed feedback that can be biased due to delayed user actions.
method Uses a time window to select samples for training, constructs unbiased empirical risk from all samples.
result Improves classifier performance by using all samples with a time window assumption.

Algorithm minimizes regret in predictive models influenced by their own predictions.

problem Finding near-optimal models under performativity with unknown shifts.
method Developed an algorithm that uses performative feedback to achieve low regret, scaling only with distribution shift complexity.
result Achieved regret bounds scaling with distribution shift complexity, not reward function complexity.

Paper measures cognitive bias in positive feedback trading using diffusion process estimates.

problem Measuring cognitive bias in positive feedback trading behavior.
method Conditional estimates of diffusion processes to quantify bias, proving asymptotic properties.
result Bias in positive feedback trading converges to zero over time, leading to adaptive expectations.

We propose a model for the credit and liquidity risks faced by clearing members of Central Counterparty Clearing houses (CCPs). This model aims to capture the features of: gap risk; feedback between clearing member default, market volatility and margining requirements; the different risks faced by various types of mark…

2016-04-01abs ↗pdf ↗

Develops variational framework for LQG risk-sensitive MFGs with major-minor interactions.

problem Risk-sensitive optimal control in LQG systems with major-minor interactions.
method Variational approach, nonlinear necessary and sufficient condition of optimality, equivalent risk-neutral measure, Markovian closed-loop best-response strategies.
result Derives optimal control strategies for LQG risk-sensitive MFGs with major-minor interactions, establishing Nash and ε\varepsilon-Nash equilibria.

Motivated by applications in clinical trials and finance, we study the problem of online convex optimization (with bandit feedback) where the decision maker is risk-averse. We provide two algorithms to solve this problem. The first one is a descent-type algorithm which is easy to implement. The second algorithm, which …

2018-10-01abs ↗pdf ↗

In machine learning we often try to optimise a decision rule that would have worked well over a historical dataset; this is the so called empirical risk minimisation principle. In the context of learning from recommender system logs, applying this principle becomes a problem because we do not have available the reward …

2019-09-18abs ↗pdf ↗

Feedback loops amplify dataset biases, affecting future model performance.

problem Feedback loops amplify biases in datasets, risking future model reliability.
method Formalized system where model interactions are recorded and reused, analyzed for bias amplification.
result Models that behave like samples from the training distribution are more stable and calibrated.

A general theory of innovation and progress in human society is outlined, based on the combat between two opposite forces (conservatism/inertia and speculative herding "bubble" behavior). We contend that human affairs are characterized by ubiquitous ``bubbles'', which involve huge risks which would not otherwise be tak…

2007-06-13abs ↗pdf ↗

We present a Bayesian view of counterfactual risk minimization (CRM) for offline learning from logged bandit feedback. Using PAC-Bayesian analysis, we derive a new generalization bound for the truncated inverse propensity score estimator. We apply the bound to a class of Bayesian policies, which motivates a novel, pote…

2018-06-29abs ↗pdf ↗

L-ARC improves model fairness by localizing risk guarantees.

problem Improving model fairness in tasks like image segmentation and wireless networks.
method Localized Adaptive Risk Control (L-ARC) updates a threshold function in RKHS to target localized statistical risk guarantees.
result L-ARC produces prediction sets with improved fairness across different data subpopulations.

A dealer manages quotes and rejection rules to control slippage risk in FX markets.

problem Managing inventory risk and latency risk in OTC FX market making.
method Dynamic programming and adiabatic-quadratic approximation to optimize quotes and rejection rules.
result Developed a method to optimize quotes and rejection rules for managing slippage risk.

A new method uses counterfactual learning to improve recommendation system evaluation.

problem Inconsistent results in recommender systems due to exposure mechanisms.
method Proposes a minimax empirical risk formulation with an adversarial game to account for exposure.
result Shows improved learning bounds and effectiveness over various recommendation settings.

An assistant learns to mediate decisions between humans and experts, balancing risk and learning.

problem Learning to mediate decisions between imperfect humans and expert knowledge.
method Formalizes online decision mediation, proposes a policy to balance immediate loss and future generalization.
result Consistent gains over benchmarks in decision-making performance.

The paper proposes a method to align AI models using conformal risk control.

problem Aligning AI models to meet end-user requirements in non-generative settings.
method Post-processing a pre-trained model to better align with a subset of functions using conformal risk control.
result A probabilistic guarantee that the resulting conformal interval around a model contains a function approximately satisfying a desired property.

Modeling bank leverage dynamics to understand systemic risk in financial markets.

problem Understanding systemic risk in financial markets triggered by bank leverage dynamics.
method Developed a dynamical model of bank leverage, analyzing coupled dynamics in isolated and interconnected bank models.
result Identified a procyclical feedback loop between asset prices and leverage, leading to chaotic dynamics.

Method improves volatility targeting for index construction.

problem High turnover, leverage spikes, and sensitivity to estimation error in existing volatility-targeting strategies.
method Proportional-control approach for setting index weights that corrects tracking error through feedback.
result The proportional-control approach achieves the target volatility more effectively than open-loop alternatives.

We study a simple, solvable model that allows us to investigate effects of credit contagion on the default probability of individual firms, in both portfolios of firms and on an economy wide scale. While the effect of interactions may be small in typical (most probable) scenarios they are magnified, due to feedback, by…

2006-09-20abs ↗pdf ↗

The theory of convex risk functions has now been well established as the basis for identifying the families of risk functions that should be used in risk averse optimization problems. Despite its theoretical appeal, the implementation of a convex risk function remains difficult, as there is little guidance regarding ho…

2016-07-24abs ↗pdf ↗