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

137274411548 · Jun 202019922001200920172026
48 results for Predictive feedback

New algorithms handle online prediction with bandit and delayed feedback, improving regret bounds.

problem Achieving finite bounds on surrogate regret with limited feedback.
method Proposed algorithms for bandit and delayed feedback, including inverse-weighted gradient and pseudo-inverse matrix estimators.
result Achieved improved surrogate regret bounds of O(KT)O(\sqrt{KT}) and O(T2/3)O(T^{2/3}).

A predictor that is deployed in a live production system may perturb the features it uses to make predictions. Such a feedback loop can occur, for example, when a model that predicts a certain type of behavior ends up causing the behavior it predicts, thus creating a self-fulfilling prophecy. In this paper we analyze p…

2013-10-10abs ↗pdf ↗

Stochastic structured prediction under bandit feedback follows a learning protocol where on each of a sequence of iterations, the learner receives an input, predicts an output structure, and receives partial feedback in form of a task loss evaluation of the predicted structure. We present applications of this learning …

2016-06-02abs ↗pdf ↗

Proposes online conformal prediction method with adversarial semi-bandit feedback.

problem Online uncertainty quantification with adversarial semi-bandit feedback.
method Formulates online conformal prediction as an adversarial bandit problem and uses regret minimization.
result Achieves long-run coverage guarantee with adversarial semi-bandit feedback.

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.

Predictive policing systems are increasingly used to determine how to allocate police across a city in order to best prevent crime. Discovered crime data (e.g., arrest counts) are used to help update the model, and the process is repeated. Such systems have been empirically shown to be susceptible to runaway feedback l…

2017-06-29abs ↗pdf ↗

Hybrid approach combines user feedback and machine learning for predicting user satisfaction.

problem Measuring user satisfaction in large-scale conversational agent systems.
method Fusion of explicit user feedback and predictions from two machine-learned models trained on different data types.
result Hybrid approach significantly improves user satisfaction predictions.

Bandit structured prediction describes a stochastic optimization framework where learning is performed from partial feedback. This feedback is received in the form of a task loss evaluation to a predicted output structure, without having access to gold standard structures. We advance this framework by lifting linear ba…

2017-04-21abs ↗pdf ↗

We present online boosting algorithms for multiclass classification with bandit feedback, where the learner only receives feedback about the correctness of its prediction. We propose an unbiased estimate of the loss using a randomized prediction, allowing the model to update its weak learners with limited information. …

2018-10-11abs ↗pdf ↗

New method learns interpretable concepts from user feedback for high-dimensional data.

problem Lack of interpretable concepts in machine learning models trained on high-dimensional tabular data.
method Proposes a method for learning transparent concept definitions from user labeling of concept features, not instances.
result Demonstrates more efficient learning of aligned concept definitions from user feedback compared to alternative transparent approaches.

Study online learning with set-valued feedback, showing differences between deterministic and randomized approaches.

problem Online learning with set-valued feedback, where labels are sets rather than single labels.
method Introduced new combinatorial dimensions (Set Littlestone and Measure Shattering) to characterize learnability.
result Characterized deterministic and randomized online learnability, and established bounds for various learning settings.

BCCP uses bandit feedback to provide reliable predictions with limited labeled data.

problem Limited labeled data and bandit feedback challenge online set-valued classification.
method BCCP uses stochastic gradient descent to train model and make set-valued inferences with unbiased estimation of true label.
result BCCP offers coverage guarantees on a class-specific granularity.

Study shows competition feedback can make ML predictors biased towards specific user groups.

problem How competition affects machine learning predictors and user prediction quality.
method Flexible model of competing ML predictors, empirical and mathematical analysis.
result Competition causes predictors to specialize for specific sub-populations at the cost of general performance.

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 apply the potential force estimation method to artificial time series of market price produced by a deterministic dealer model. We find that dealers' feedback of linear prediction of market price based on the latest mean price changes plays the central role in the market's potential force. When markets are dominated…

2007-10-09abs ↗pdf ↗

Predicting conversion rates (CVRs) in display advertising (e.g., predicting the proportion of users who purchase an item (i.e., a conversion) after its corresponding ad is clicked) is important when measuring the effects of ads shown to users and to understanding the interests of the users. There is generally a time de…

2018-02-01abs ↗pdf ↗

CAFL breaks feedback loops in recommender systems using causal inference.

problem Feedback loops in recommender systems compromise recommendation quality and homogenize user behavior.
method Causal Adjustment for Feedback Loops (CAFL) algorithm that breaks feedback loops using causal inference.
result CAFL improves recommendation quality compared to prior correction methods.

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 new method for online prediction uncertainty quantification in non-exchangeable panel data.

problem Challenges in quantifying predictive uncertainty for non-exchangeable panel data.
method Online conformal prediction framework for non-exchangeable panel data, using similarity weights and adaptive miscoverage levels.
result Improves coverage on worst-covered target units through adaptive interval-width allocation.

Deep Reinforcement Learning has enabled the control of increasingly complex and high-dimensional problems. However, the need of vast amounts of data before reasonable performance is attained prevents its widespread application. We employ binary corrective feedback as a general and intuitive manner to incorporate human …

2019-03-14abs ↗pdf ↗

JoVA combines two VAEs to learn user and item representations for better recommendation.

problem Collaborative filtering with implicit feedback.
method Joint Variational Autoencoders (JoVA) with a hinge-based pairwise loss function (JoVA-Hinge).
result JoVA-Hinge outperforms state-of-the-art methods in top-k recommendation.

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.

This paper considers a variant of the classical online learning problem with expert predictions. Our model's differences and challenges are due to lacking any direct feedback on the loss each expert incurs at each time step tt. We propose an approach that uses peer prediction and identify conditions where it succeeds.…

2019-10-10abs ↗pdf ↗

CNN-F uses generative feedback to improve neural networks' robustness to perturbations.

problem Neural networks' vulnerability to input perturbations like noise and attacks.
method Enforces self-consistency in neural networks by incorporating generative recurrent feedback.
result CNN-F shows significantly improved adversarial robustness compared to conventional CNNs.

New framework uses user feedback in CB problems for better decision-making.

problem Improving decision-making in contextual bandit problems with user-triggered feedback.
method Developed a new framework to leverage user-triggered feedback in CB problems, robust to feedback bias.
result Improved regret guarantees for CB algorithms using user feedback.

Algorithm provides online learning guarantees against general comparators in full and bandit feedback.

problem Adversarial online learning with data-dependent regret guarantees.
method Completely online algorithm with data-dependent regret guarantees for full and bandit feedback.
result Algorithm achieves expected performance against arbitrary comparator sequences in full and bandit feedback settings.

Autoregressive state transitions, where predictions are conditioned on past predictions, are the predominant choice for both deterministic and stochastic sequential models. However, autoregressive feedback exposes the evolution of the hidden state trajectory to potential biases from well-known train-test discrepancies.…

2019-08-30abs ↗pdf ↗

Agents trained in simulation may make errors in the real world due to mismatches between training and execution environments. These mistakes can be dangerous and difficult to discover because the agent cannot predict them a priori. We propose using oracle feedback to learn a predictive model of these blind spots to red…

2018-05-23abs ↗pdf ↗

New algorithm minimizes expert selection regret in partial bandit feedback.

problem Minimizing expert selection regret in partial bandit feedback.
method Develops a sequential minimax optimal algorithm for a generalized partial monitoring setting.
result Second order regret bounds against a general expert selection sequence.

Framework identifies population quantities from MNAR feedback using weak shadow variables from pretrained models.

problem Estimating mean outcomes from MNAR user feedback with bias and lack of identification.
method Develops a partial identification framework using linear programs and weak shadow variables from pretrained models.
result Bounds on estimand are obtained by solving linear programs incorporating pretrained model predictions.