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

275480107 · Jun 202019922001200920172026
48 results for expert feedback

Unified framework for expert selection with bandit and lower-bound feedback.

problem Selecting the best expert in scenarios with bandit feedback and lower-bound information.
method Introduces a new feedback model combining bandit and lower-bound information, proving optimal regret bounds for modified Exp3 algorithms.
result Optimal regret bounds for modified Exp3 algorithms, generalizing both bandit and full-information settings.

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.

Improved regret bounds for bandits with expert advice.

problem Optimizing decision-making in environments with expert advice.
method Proved lower and upper bounds for regret in restricted and standard feedback models.
result Proved a new upper bound of order KTln(N/K)\sqrt{K T \ln(N/K)} for the worst-case regret, matching a previously known lower bound.

The article is devoted to investigating the application of hedging strategies to online expert weight allocation under delayed feedback. As the main result, we develop the General Hedging algorithm G\mathcal{G} based on the exponential reweighing of experts' losses. We build the artificial probabilistic framework and …

2019-02-27abs ↗pdf ↗

AGFN improves causal discovery by integrating expert feedback and handling latent confounding.

problem Inaccurate causal discovery due to unreliable expert knowledge and latent confounding.
method Ancestral GFlowNet (AGFN) is a reinforcement learning algorithm that iteratively refines a policy based on noisy expert feedback to infer ancestral graphs.
result AGFN converges to the true ancestral graph given accurate expert responses and outperforms baselines in structural Hamming distance and Bayesian Information Criterion.

Optimal investment strategy with expert opinions in uncertain conditions.

problem Optimizing wealth in a model with unobservable drift and costly expert opinions.
method Embedding into a full information problem, using viscosity solutions and stochastic Perron's method.
result Constructing optimal trading and expert opinion strategies under sufficient regularity conditions.

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.

Framework learns robust control policies from expert demonstrations.

problem Adversarial robustness and closed-loop generalization in feedback control policies.
method Lipschitz-constrained loss minimization for certified robustness and generalization.
result Finite sample bound on policy learning error and robust closed-loop stability.

New findings explain why online methods outperform offline methods in noisy expert feedback settings.

problem The challenge of learning from imperfect expert feedback in sequential decision-making systems.
method Introduced a noisy expert model and a novel variant of on-policy distillation (OPD) to address the gap between offline and online imitation learning.
result Online interaction with a noisy expert via OPD enables polynomial dependence on the horizon, unlike offline methods which require exponential growth in sample complexity.

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 ↗

Improved cumulative regret for sequence prediction with limited expert advice.

problem Minimizing cumulative regret in sequence prediction with limited information.
method Convex combination of experts with limited observation, achieving constant regret.
result Strategies achieve constant regret independent of the horizon T, improving over standard bounds.

A human-in-the-loop ML framework for precision dosing reduces expert workload and removes bias.

problem High cost of data annotation and lack of appropriate data for ML models.
method Incorporates human experts into the model learning loop to improve interpretability and reduce bias.
result The approach learns interpretable rules from data and potentially lowers expert workload.

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.

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.

Fuzzy cognitive maps (FCMs) model feedback causal relations in interwoven webs of causality and policy variables. FCMs are fuzzy signed directed graphs that allow degrees of causal influence and event occurrence. Such causal models can simulate a wide range of policy scenarios and decision processes. Their directed loo…

2019-06-26abs ↗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 on a new family of problems interpolating expert advice and multi-armed bandits.

problem A new family of problems combining expert advice and multi-armed bandits.
method Proved minimax regret bounds and designed optimal PAC algorithms for pure exploration.
result Tight minimax regret bounds and optimal PAC algorithm for m\mathbf{m}-BAI.

New algorithm reduces regret in strategic prediction problem.

problem Designing an IC algorithm with sublinear regret for strategic experts.
method Developed a new algorithm WSU-UX and proved a worst-case regret bound.
result WSU-UX suffers a Ω(T2/3)Ω(T^{2/3}) lower bound on regret.

Paper introduces a novel reward function for noisy financial markets using imitation learning.

problem Noisy reward function in financial markets hinders RL agent performance.
method Integrates imitation learning feedback with reinforcement learning to improve reward function design.
result Improves financial performance metrics compared to traditional benchmarks and RL agents.

Proposes a TS approach for Bayesian optimization with preferential feedback.

problem Optimizing with preference feedback in complex applications.
method Uses Thompson Sampling with a dueling kernel and anchor invariance.
result Performance matches standard TS for scalar feedback in finite time.

New algorithm tackles dynamic query routing to multiple embedding models.

problem Dynamic query routing to multiple embedding models under adversarial conditions.
method Formalized as adversarial contextual linear bandit with low-rank experts, proposed HPG algorithm.
result HPG algorithm achieves linearized policy regret of ildeO(sMT) ilde{\mathcal O}(s\sqrt{M T}).

Meta-algorithm optimizes nonstochastic bandits with infinitely many experts.

problem Maximizing reward by choosing actions sequentially from a set of experts.
method Proposed a variant of Exp4.P for infinitely many experts and a meta-algorithm.
result Proved high-probability upper bound of ildeO(iK+KT) ilde{\mathcal{O}} \big( i^*K + \sqrt{KT} \big) on regret.

We revisit the fundamental problem of prediction with expert advice, in a setting where the environment is benign and generates losses stochastically, but the feedback observed by the learner is subject to a moderate adversarial corruption. We prove that a variant of the classical Multiplicative Weights algorithm with …

2020-02-24abs ↗pdf ↗

Develops a real-time exercise recommendation system using deep learning.

problem Improving accuracy in exercise recommendation systems without user feedback.
method Deep recurrent neural network with attention mechanisms, real-time expert feedback.
result Improved accuracy in exercise recommendation system after real-time active learning.

Bayesian algorithms improve online learning with adversaries over infinite action spaces.

problem Online learning with adversaries over infinite action spaces.
method Developed a Thompson sampling algorithm for online learning with an adversary's prior over the space of actions.
result Thompson sampling over a Gaussian process prior achieves a rate of O(βTdlog(1+dλβ))O(β\sqrt{Td\log(1+\sqrt{d}\fracλβ)}) against a ββ-bounded λλ-Lipschitz adversary.

We study how to effectively leverage expert feedback to learn sequential decision-making policies. We focus on problems with sparse rewards and long time horizons, which typically pose significant challenges in reinforcement learning. We propose an algorithmic framework, called hierarchical guidance, that leverages the…

2018-03-01abs ↗pdf ↗

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.

A matching in a two-sided market often incurs an externality: a matched resource may become unavailable to the other side of the market, at least for a while. This is especially an issue in online platforms involving human experts as the expert resources are often scarce. The efficient utilization of experts in these p…

2017-03-02abs ↗pdf ↗

Imitation learning is a control design paradigm that seeks to learn a control policy reproducing demonstrations from expert agents. By substituting expert demonstrations for optimal behaviours, the same paradigm leads to the design of control policies closely approximating the optimal state-feedback. This approach requ…

2019-01-07abs ↗pdf ↗

Study reduces human labeling in LLM-based classification systems.

problem Minimizing human intervention in training LLM-based classification systems.
method Active learning framework with Conservative Hull-based Classifier (CHC), Center-based Classifier (CC), and Generalized Hull-based Classifier (GHC).
result CHC achieves O(logdT)\mathcal{O}(\log^d T) regret and is minimax optimal for d=1d=1. GHC bridges the gap between different regimes.

Scarcity of labeled data is one of the most frequent problems faced in machine learning. This is particularly true in relation extraction in text mining, where large corpora of texts exists in many application domains, while labeling of text data requires an expert to invest much time to read the documents. Overall, st…

2018-07-12abs ↗pdf ↗

We study the power of different types of adaptive (nonoblivious) adversaries in the setting of prediction with expert advice, under both full-information and bandit feedback. We measure the player's performance using a new notion of regret, also known as policy regret, which better captures the adversary's adaptiveness…

2013-02-18abs ↗pdf ↗

Interactive learning with hindsight instruction feedback achieves better performance than traditional methods.

problem Learning with expert supervision of optimal responses is often impractical or requires expert knowledge.
method Study of interactive learning with hindsight instruction feedback, introducing LORIL algorithm.
result LORIL algorithm achieves T\sqrt{T} regret, improving over baselines in domains with low-rank instruction-response distribution.

To widen their accessibility and increase their utility, intelligent agents must be able to learn complex behaviors as specified by (non-expert) human users. Moreover, they will need to learn these behaviors within a reasonable amount of time while efficiently leveraging the sparse feedback a human trainer is capable o…

2019-02-12abs ↗pdf ↗

Automated suggestions help train technicians diagnose incidents faster.

problem Manual and time-consuming incident diagnosis by train maintenance technicians.
method Developed and deployed a learning machine to suggest diagnostics to technicians.
result The model refines its accuracy through feedback from experts and uses feature engineering.