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

50101151201 · May 202619922001200920172026
48 results for positive feedback

New method learns from either positive or negative feedback alone.

problem Limited applicability of existing preference optimization methods in scenarios with only unpaired feedback.
method Decouples learning from positive and negative feedback, using expectation-maximization (EM) to optimize probability of positive outcomes and explicitly incorporate negative examples.
result Stable learning from negative feedback alone demonstrated.

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.

Framework uses human feedback to safely set OOD detection thresholds, reducing false positives.

problem Challenges in setting OOD detection thresholds for safety-critical applications.
method Mathematically grounded framework leveraging expert feedback to dynamically update thresholds.
result Guaranteed to meet FPR constraint while minimizing human feedback, maintaining FPR at most 5%.

Study how communication and feedback graphs affect learning outcomes.

problem Understanding the impact of feedback graphs on cooperative online learning.
method Analyzed network regret in terms of the independence number of the strong product of communication and feedback graphs.
result Proved bounds for network regret and demonstrated the non-improvable nature of positive results in pathological cases.

Anomaly detectors are often used to produce a ranked list of statistical anomalies, which are examined by human analysts in order to extract the actual anomalies of interest. Unfortunately, in realworld applications, this process can be exceedingly difficult for the analyst since a large fraction of high-ranking anomal…

2017-08-30abs ↗pdf ↗

Social media systems rely on user feedback and rating mechanisms for personalization, ranking, and content filtering. However, when users evaluate content contributed by fellow users (e.g., by liking a post or voting on a comment), these evaluations create complex social feedback effects. This paper investigates how ra…

2014-05-06abs ↗pdf ↗

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 ↗

Whenever a social media user decides to share a story, she is typically pleased to receive likes, comments, shares, or, more generally, feedback from her followers. As a result, she may feel compelled to use the feedback she receives to (re-)estimate her followers' preferences and decides which stories to share next to…

2019-09-01abs ↗pdf ↗

New oracle uses uncertainty for active classification with noisy feedback.

problem Improving query complexity in interactive binary classifier learning.
method Proposes a new pairwise comparison oracle that considers uncertainty and an adaptive labeling algorithm.
result Demonstrates improved performance and efficiency compared to existing methods.

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.

Multimodal analysis assesses job interview performance and provides feedback.

problem Assessing candidate performance in interviews for professional roles.
method Multimodal analytical framework using video, audio, and text data.
result The proposed methodology achieved promising results in predicting behavioral cues.

Recent advances in multi-modal vision and language tasks enable a new set of applications. In this paper, we consider the task of generating natural language fashion feedback on outfit images. We collect a unique dataset, which contains outfit images and corresponding positive and constructive fashion feedback. We trea…

2019-06-15abs ↗pdf ↗

New ranking algorithms improve online content delivery by learning from click data.

problem Bias in ranking systems due to production system biases.
method Proposed novel extensions of LinUCB and Linear Thompson Sampling algorithms to handle position-based click model.
result Validated the proposed algorithms through offline and online experiments.

New algorithms control loss and constraints in uncertain, changing environments.

problem Adapting to adversarial constraints in uncertain, changing environments.
method Developed algorithms for constrained MAB problems with optimal rates of regret and positive constraint violation.
result Achieved optimal rates of regret and positive constraint violation under varying degrees of adversariality.

The paper tackles efficient change point detection with limited samples.

problem Identifying multiple change points with minimal queries in noisy environments.
method Adaptive algorithm that first detects likely change points and refines their locations.
result The sample complexity is jointly governed by jump magnitudes and change point positions.

We study an online classification problem with partial feedback in which individuals arrive one at a time from a fixed but unknown distribution, and must be classified as positive or negative. Our algorithm only observes the true label of an individual if they are given a positive classification. This setting captures …

2019-02-06abs ↗pdf ↗

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.

Online learning with one-sided feedback aims to maximize accuracy while ensuring fairness.

problem Maximizing accuracy in online learning with limited feedback and ensuring fairness.
method Extending the framework of Bechavod et al. (2020) to incorporate dynamic panels of auditors, reducing the problem to a contextual combinatorial semi-bandit, and leveraging Exp2 and Context-Semi-Bandit-FTPL algorithms.
result Multi-criteria no regret guarantees for accuracy and fairness are provided.

Knowledge distillation (KD) is a well-known method to reduce inference latency by compressing a cumbersome teacher model to a small student model. Despite the success of KD in the classification task, applying KD to recommender models is challenging due to the sparsity of positive feedback, the ambiguity of missing fee…

2019-11-13abs ↗pdf ↗

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 ↗

Approach collects missing outcomes to improve fairness in classification.

problem Lack of true outcomes for incorrectly classified samples leads to biased classifiers.
method Exploration-based data collection to ensure all subpopulations are represented and fairness properties are encoded.
result Trained classifier converges to a fair classifier with bounded false positives.

Stochastic linear bandits are a natural and well-studied model for structured exploration/exploitation problems and are widely used in applications such as online marketing and recommendation. One of the main challenges faced by practitioners hoping to apply existing algorithms is that usually the feedback is randomly …

2018-07-05abs ↗pdf ↗

In display advertising, predicting the conversion rate (CVR), meaning the probability that a user takes a predefined action on an advertiser's website, is a fundamental task for estimating the value of displaying an advertisement to a user. There are two main challenges in CVR prediction due to delayed feedback. First,…

2019-10-04abs ↗pdf ↗

A new federated bandit problem with multiple adversaries, solved with a near-optimal algorithm.

problem Non-stochastic federated multi-armed bandit problem with multiple adversaries.
method Proposed a near-optimal federated bandit algorithm called FEDEXP3.
result Guaranteed sub-linear regret without exchanging sequences of selected arm identities or loss sequences among agents.

Latent factor models for Recommender Systems with implicit feedback typically treat unobserved user-item interactions (i.e. missing information) as negative feedback. This is frequently done either through negative sampling (point--wise loss) or with a ranking loss function (pair-- or list--wise estimation). Since a ze…

2018-04-30abs ↗pdf ↗

Work shows hallucination detection by LLMs is impossible without expert feedback.

problem Detecting hallucinations in LLMs is theoretically impossible without expert-labeled feedback.
method Investigated hallucination detection using a theoretical framework inspired by language identification.
result Automated hallucination detection is impossible for most language collections without expert-labeled feedback.

Study personalizes user experience to maximize rewards with patience budget.

problem Maximizing rewards for a platform while respecting user patience.
method Proposes bandit algorithms for sequential choice with feedback models.
result Upper and lower bounds on regret of order O(N2/3)O(N^{2/3}) and Ω(N2/3)Ω(N^{2/3}).

Financial time series exhibit a number of interesting properties that are difficult to explain with simple models. These properties include fat-tails in the distribution of price fluctuations (or returns) that are slowly removed at longer timescales, strong autocorrelations in absolute returns but zero autocorrelation …

2013-06-20abs ↗pdf ↗