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

58116174232 · Jun 202019922001200920172026
48 results for feedback strategy

We introduce an autoregressive-type model of prices in financial market taking into account the self-modulation effect. We find that traders are mainly using strategies with weighted feedbacks of past prices. These feedbacks are responsible for the slow diffusion in short times, apparent trends and power law distributi…

2003-12-20abs ↗pdf ↗

This paper studies the Glosten Milgrom model whose risky asset value admits an arbitrary discrete distribution. Contrast to existing results on insider's models, the insider's optimal strategy in this model, if exists, is not of feedback type. Therefore a weak formulation of equilibrium is proposed. In this weak formul…

2013-10-18abs ↗pdf ↗

Not all types of supervision signals are created equal: Different types of feedback have different costs and effects on learning. We show how self-regulation strategies that decide when to ask for which kind of feedback from a teacher (or from oneself) can be cast as a learning-to-learn problem leading to improved cost…

2019-07-11abs ↗pdf ↗

Proposes a method to select fair performance metrics through metric elicitation.

problem Choosing fair performance metrics in multiclass classification with multiple sensitive groups.
method Metric elicitation strategy that requires only relative preference feedback and is robust to noise.
result Elicits group-fair performance metrics for multiclass classification problems.

Efficiently identifies good policies by choosing contexts for human feedback.

problem Efficiently identifying good policies in applications with high feedback costs.
method Introduces offline contextual dueling bandit setting and an upper-confidence-bound style algorithm.
result Proves a regret bound and shows superior performance over uniformly sampled contexts.

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 ↗

Bayesian model identifies three types of travelers adapting to feedback.

problem Capturing adaptive, feedback-driven travel behavior in heterogeneous individuals.
method Latent Class Reinforcement Learning (LCRL) model with Variational Bayes estimation.
result Three distinct traveler classes identified: context-dependent, persistent exploitative, and exploratory.

PABBO optimizes user utility learning from preferential feedback, significantly faster than traditional methods.

problem Computational inefficiency in Preferential Bayesian Optimization (PBO) methods.
method Amortized Bayesian Optimization (PABBO) using transformer neural processes and reinforcement learning.
result Significantly faster performance compared to traditional Gaussian process-based methods.

PILAF optimizes reward models from human feedback for better policy alignment.

problem Creating accurate reward models from human feedback for policy optimization.
method Policy-Interpolated Learning for Aligned Feedback (PILAF) that explicitly aligns preference learning with maximizing underlying oracle reward.
result PILAF is optimal from both optimization and statistical perspectives, demonstrating strong performance in RLHF settings.

New algorithms minimize regret in repeated auctions by estimating values and optimizing bids.

problem Minimizing regret in repeated first-price auctions with limited feedback.
method Incorporates causal inference to estimate private values and optimize bidding strategies under different feedback types.
result Achieves near-optimal regret bounds for both full and binary feedback types.

New algorithm for active learning from feedback coding.

problem Efficiently selecting examples for labeling in active machine learning.
method Formalized structural similarities between active learning and feedback channel coding, developed an optimal transport-based algorithm called Approximate Posterior Matching (APM).
result Learning performance comparable to existing methods at reduced computational cost.

Study optimal arms in combinatorial bandits with semi-bandit feedback and finite budget.

problem Finding optimal arms in combinatorial bandits with semi-bandit feedback and finite budget constraints.
method Proposes a generic algorithm covering various arm elimination strategies and derives lower bounds.
result Demonstrates sufficient and necessary budget requirements for finding the best arm.

New algorithms for efficient learning with partial information, reducing regret.

problem Online learning with partial observability and semi-bandit feedback.
method Implicit exploration strategy for near-optimal regret guarantees.
result First algorithms with near-optimal regret guarantees without knowing the observation system.

Study optimizes dynamic product selection and pricing using censored preference feedback.

problem Maximizing revenue from dynamic assortment and pricing decisions.
method Proposes a censored multinomial logit model and LCB pricing strategy combined with UCB or TS product selection.
result Achieves optimal regret bounds for dynamic pricing and selection.

Theoretical model for iterative user discovery in recommender systems.

problem Iterative feedback loops in recommender systems and their biases.
method Theoretical framework to model system evolution and convergence properties.
result Theoretical bounds and convergence properties on user discovery and blind spots.

New framework tackles submodular welfare with multi-agent combinatorial bandits.

problem Maximizing total welfare among agents with shared constraints and submodular utilities under bandit feedback.
method Proposes an explore-then-commit strategy with randomized assignments for multi-agent combinatorial bandits.
result Achieves ildeO(T2/3) ilde{\mathcal{O}}(T^{2/3}) regret, first for partition-based submodular welfare problem under bandit feedback.

RANDomized-exploration policy Optimization via Multiple Importance Sampling with Truncation (RANDOMIST) for PO with mediator feedback.

problem Policy Optimization in continuous control tasks.
method RANDomized-exploration policy Optimization via Multiple Importance Sampling with Truncation (RANDOMIST) for regret minimization in PO.
result Achieving constant regret under certain circumstances in PO with mediator feedback.

The paper calculates how fast optimal investment strategies approach CRRA strategies in stochastic factor models.

problem Understanding convergence rates of optimal investment strategies in stochastic factor models.
method Analyzes optimal feedback functions in nonlinear and quadratic term structure models, considering decay of bond prices and power-like utility at high wealth levels.
result Convergence rates of optimal investment strategies to CRRA strategies are determined by bond price decay and power-like utility behavior.

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.

Convolutional neural networks (CNNs) are commonly used for image classification tasks, raising the challenge of their application on data flows. During their training, adaptation is often performed by tuning the learning rate. Usual learning rate strategies are time-based i.e. monotonously decreasing. In this paper, we…

2019-11-18abs ↗pdf ↗

Dual active learning improves RLHF by selecting optimal conversations and teachers.

problem Efficiently aligning LLMs with human preferences using RLHF from feedback.
method Offline RL for conversation and teacher selection, dual active reward learning, pessimistic RL.
result The proposed algorithm achieves minimal generalized variance and outperforms state-of-the-arts.

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.

This paper analyzes optimal consumption strategies for loss-averse investors with multiplicative habit formation.

problem Optimal consumption strategies for loss-averse investors with multiplicative habit formation.
method The study uses a concave envelope of the S-shaped utility function and a nonlinear free boundary problem to analyze the HJB equation.
result The paper provides optimal consumption and investment policies in feedback form.

Paper proposes a new RLHF framework for human preference learning.

problem Handling dependent online human preference outcomes with dynamic contexts.
method Two-stage algorithm with εε-greedy followed by exploitation; anti-concentration inequalities and matrix martingale concentration techniques.
result Our method achieves optimal regret bound and asymptotic normality of estimators.

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 ↗

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.

The paper solves a consumption-investment problem with state-dependent lower bounds.

problem A life-time consumption-investment problem with a state-dependent lower bound on consumption.
method Transformed the problem into a state-independent control problem to apply standard theory.
result Explicit optimal strategies provided for both homogeneous and non-homogeneous constraints.

Study optimal portfolio strategies with time-varying discount rates.

problem Optimizing portfolio decisions with a non-constant discount rate.
method Introduced subgame perfect strategies to handle time inconsistency, using fixed point iteration to find the utility-weighted discount rate.
result Subgame perfect strategies are equivalent to optimal strategies under certain utility function assumptions.

The paper analyzes optimal consumption with past spending maximum as a reference.

problem Optimal consumption with past spending maximum as a reference.
method Path-dependent exponential utility, Hamilton-Jacobi-Bellman (HJB) equation, dual transform, smooth-fit principle.
result Closed-form solutions for optimal investment and consumption strategies in each region.