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

3775112149 · Jun 202019922001200920182026
48 results for Feedback Signals

FinRLlama wins FinRL Challenge 2024 by fine-tuning LLMs with market data.

problem Lack of contextual alignment for financial market applications in traditional LLMs.
method Fine-tuning LLaMA-3.2-3B-Instruct model with custom RLMF prompt design integrating historical data and reward feedback.
result RLMF-tuned FinRLlama framework outperforms baseline methods in signal consistency and trading outcomes.

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.

Paper proposes verifier engineering for improving foundation models.

problem Challenges in providing effective supervision signals for foundation models.
method Leverages automated verifiers to perform verification tasks and deliver feedback.
result Verifier engineering can enhance foundation models' capabilities.

Improved flow-based inference speeds up and boosts accuracy for complex simulations.

problem Challenging inverse problems in astronomy, such as modeling strong gravitational lens systems.
method Refines flow-based generative models with simulator feedback for posterior inference.
result Improves accuracy by 53% and speeds up inference by up to 67x.

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.

A new learning method for prosthetic arms without explicit rewards.

problem Learning a prosthetic arm to interact with users without explicit reward signals.
method Interaction-Grounded Learning, observing multidimensional context and feedback vectors, discovering latent reward signal.
result The algorithm can discover a latent reward signal and ground its policies for successful interaction.

Self-regulation improves sequence-to-sequence learning by choosing feedback types.

problem Different types of feedback have varying costs and effects on learning.
method Self-regulation strategies decide when to ask for different types of feedback.
result Self-regulator discovers optimal cost-quality trade-off by mixing feedback types.

New algorithm tackles non-stationary delayed feedback in recommender systems.

problem Challenges in learning from delayed feedback in non-stationary environments.
method Developed a UCRL-based algorithm for non-stationary, delayed bandits with intermediate observations.
result Sublinear regret guarantees for the proposed algorithm in non-stationary delayed environments.

Neural networks are commonly trained to make predictions through learning algorithms. Contrastive Hebbian learning, which is a powerful rule inspired by gradient backpropagation, is based on Hebb's rule and the contrastive divergence algorithm. It operates in two phases, the forward (or free) phase, where the data are …

2018-06-19abs ↗pdf ↗

Robustly combines supervised and bandit feedback for contextual bandits.

problem Learning from mixed supervised and bandit data with potentially misaligned costs.
method Developed no-regret algorithms robust to misaligned cost distributions.
result Our approach is feasible and helpful in practice, as shown by empirical evaluations.

Study shows reinforcement learning is possible with once-per-episode feedback.

problem Challenges of reinforcement learning with sparse feedback.
method Introduced a model where trajectory labels are generated by an unknown parametric model and developed an algorithm for sublinear regret.
result Achieved sublinear regret with a statistically and computationally efficient algorithm.

Study tests feasibility of linear programs with bandit feedback.

problem Testing feasibility of unknown linear programs with bandit feedback.
method Developed a novel test based on low-regret algorithms and a nonasymptotic law of iterated logarithms.
result Proved that the test is reliable and adapts to the signal level, with mean sample costs scaling as \( \widetilde{O}(d^2/Γ^2) \).

Proposes a new theoretical framework for PbRL that requires less human feedback.

problem Lack of theoretical work capturing practical PbRL frameworks.
method Introduces a reward-agnostic PbRL framework that acquires exploratory trajectories before human feedback.
result Demonstrates improved sample complexity for learning optimal policies in linear and low-rank MDPs.

CausalRM models rewards from user feedback, overcoming noise and bias.

problem Aligning language models with user preferences from noisy, biased feedback.
method Causal-theoretic reward modeling framework addressing noise and bias in observational feedback.
result CausalRM learns accurate reward signals from noisy and biased observational feedback.

Artificial neural networks are most commonly trained with the back-propagation algorithm, where the gradient for learning is provided by back-propagating the error, layer by layer, from the output layer to the hidden layers. A recently discovered method called feedback-alignment shows that the weights used for propagat…

2016-09-06abs ↗pdf ↗

ERNN improves RNN accuracy and stability with time-delayed self-feedback.

problem Inaccuracy and instability in RNNs.
method Augmenting RNN with a time-delayed self-feedback loop to stabilize hidden state transitions.
result ERNN achieves state-of-the-art results on benchmark datasets.

Binary feedback outperforms ordinal comparisons in ranking recovery.

problem Challenges the conventional wisdom that ordinal comparisons offer richer information.
method Proposes a parametric framework for modeling ordinal paired comparisons, binarizing ordinal data, and proving faster convergence rates for binary comparisons.
result Binarizing ordinal data significantly improves ranking recovery accuracy and exhibits a substantial performance gap.

In this work, we propose a novel recurrent neural network (RNN) architecture. The proposed RNN, gated-feedback RNN (GF-RNN), extends the existing approach of stacking multiple recurrent layers by allowing and controlling signals flowing from upper recurrent layers to lower layers using a global gating unit for each pai…

2015-02-09abs ↗pdf ↗

This paper extends a Kyle model to include price-responsive traders, revealing new dynamics and equilibria.

problem Real-world market dynamics involve price-responsive traders, affecting market equilibrium and insider profits.
method Developed a continuous-time Kyle model with two types of price-responsive traders (momentum and contrarian), leading to a forward-backward Riccati system for equilibrium.
result The model shows that feedback effects can lead to multiple equilibria and amplify price informativeness.

This paper explores LETOR for E-Com search, addressing practical challenges and reporting key findings.

problem Applying LETOR to E-Com search presents unique challenges.
method Investigates practical challenges in LETOR for E-Com search, including feature representation, relevance judgments, and feedback signal exploitation.
result LETOR methods can effectively optimize combinations of popularity-based and relevance-based features, and order rate is the most robust training objective.

The paper optimizes portfolios using MACD signals derived from price history.

problem Optimizing risky asset portfolios with latent mean-reverting and momentum factors.
method Derives optimal strategies based on MACD signals from EMA processes.
result Establishes admissibility and verification of optimal strategies.

New RLHF framework handles general preference oracles without reward functions.

problem Handling general preference oracles without assuming a reward function.
method Developed a minimax game between two LLMs for RLHF under a general preference oracle, focusing on KL-regularized preference.
result Proposed algorithms for efficient offline and online RLHF learning.

We propose a method for learning cyclic causal models from a combination of observational and interventional equilibrium data. Novel aspects of the proposed method are its ability to work with continuous data (without assuming linearity) and to deal with feedback loops. Within the context of biochemical reactions, we a…

2013-09-26abs ↗pdf ↗

We introduce a new class of reinforcement learning methods referred to as {\em episodic multi-armed bandits} (eMAB). In eMAB the learner proceeds in {\em episodes}, each composed of several {\em steps}, in which it chooses an action and observes a feedback signal. Moreover, in each step, it can take a special action, c…

2015-08-04abs ↗pdf ↗

A new method optimizes recommender systems by addressing missing-not-at-random implicit feedback.

problem Missing-not-at-random implicit feedback in recommender systems.
method Defining an ideal loss function and proposing an unbiased estimator to optimize relevance.
result The proposed method improves performance, especially for rare items.