New algorithm for linear bandits learns from feature feedback, reducing regret.
problem Linear bandit problem with feature feedback.
method Developed new theory and algorithms for linear bandits with feature feedback.
result Achieves regret scaling like k T k\sqrt{T} k T , improving over traditional linear bandits. Study analyzes feedback complexity for sparse feature retrieval in deep networks.
problem Learning sparse superposed features with feedback.
method Analysis of feedback complexity in sparse settings, including triplet comparisons.
result Establishes tight bounds and strong upper bounds for feature recovery.
Paper introduces robust learning from feature feedback, even with annotator errors.
problem Learning from human feedback on discriminative features, especially when annotators make mistakes.
method Develops a robust framework for learning with imperfect feedback, deriving regret bounds in adversarial and stochastic settings.
result Regret bounds independent of feature number, showing robust learning is not reducible to non-robust settings.
New robust algorithms improve learning with feature feedback.
problem Interactive learning with discriminative feature feedback.
method Developed new robust interactive learning algorithms with improved mistake bounds.
result Achieved significantly lower mistake bounds in adversarial and stochastic settings.
This paper improves image retrieval accuracy through novel relevance feedback methods.
problem Improving image retrieval accuracy in Content-Based Image Retrieval (CBIR).
method Novel addition to feature re-weighting and classification techniques, focusing on 0-th iteration improvement.
result Significantly improved retrieval accuracy from relevance feedback.
New algorithm learns Gaussian policies from corrective human feedback, outperforming current methods.
problem Learning from corrective human feedback for complex systems.
method Gaussian Process Coach (GPC) that uses Gaussian Processes and policy uncertainty for optimal feedback selection and learning rate adaptation.
result Demonstrated superior performance in OpenAI Gym benchmarks compared to COACH.
SAIN integrates user-item feedback with content attributes for better recommendation.
problem Cold start problems in recommendation models due to sparse user-item interactions.
method SAIN uses a self-attention mechanism to capture feature interactions and an information integration layer to combine feedback and content information.
result SAIN outperforms state-of-the-art models by 2.13% on public datasets.
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.
Algorithm clusters items by sequentially selecting features, minimizing observations.
problem Clustering items based on bandit feedback with many features.
method Sequential Halving algorithm for feature selection.
result Accurate recovery of item partition with minimal observations.
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…
This study compares traditional ML and deep learning for classifying multilingual user feedback.
problem Classifying multilingual user feedback for software development teams.
method Comparison of traditional machine learning and deep learning approaches.
result Traditional machine learning can achieve comparable results to deep learning for multilingual user feedback classification.
Interactive RL and DT feedback improve feature selection efficiency.
problem Balancing feature selection effectiveness and efficiency.
method Interactive Reinforcement Learning (IRL) and Decision Tree Feedback (DTF) architecture.
result Improved feature selection performance on real-world datasets.
Calibrates Hawkes models for market events, revealing power-law feedback kernels.
problem Estimating the influence of past events and price changes on future market events.
method Proposes a calibration procedure for Quadratic Hawkes models, analyzing the kernel components.
result Empirically calibrated kernel components reveal power-law behavior, suggesting system near critical point.
Generates detailed fashion feedback from outfit images.
problem Creating informative and diverse fashion feedback from outfit images.
method Trained deep generative models with visual attention, then improved with Maximum Mutual Information objective function.
result Generated sentences are more diverse and detailed.
In a wide variety of applications, including personalization, we want to measure the difference in outcome due to an intervention and thus have to deal with counterfactual inference. The feedback from a customer in any of these situations is only 'bandit feedback' - that is, a partial feedback based on whether we chose…
LoCo-RLHF models diverse human feedback with contextual information.
problem Heterogeneous human feedback from diverse contexts and preferences.
method Low-rank contextual preference model, PRS policy.
result LoCo-RLHF achieves tighter sub-optimality gap than existing methods.
DFNets uses feedback-looped filters for better graph CNN performance.
problem Improving CNN performance on graph structured data.
method DFNets incorporates feedback-looped spectral graph filters.
result DFNets outperforms state-of-the-art methods in document and entity classification tasks.
New RL method optimizes power and accuracy for activity recognition.
problem Balancing power consumption and accuracy in wearable devices for activity recognition.
method Reinforcement Learning with multiple feedback sources for feature selection.
result Achieved good trade-off between power consumption and accuracy.
Gradient descent with error feedback performs better than vanilla when features are rare.
problem Improving communication complexity in distributed optimization with rare features.
method Gradient descent with greedy sparsification and error feedback for rare features.
result Communication complexity improves as features become more rare, potentially better than vanilla GD.
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.
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.
Adaptive reward models capture individual preferences from human feedback.
problem Learning a reward model that can be specialised to a user.
method Empirical risk minimisation and PAC bound analysis.
result Adaptive reward models benefit from the heterogeneity of user preferences.
Predicting the efficacy of a drug for a given individual, using high-dimensional genomic measurements, is at the core of precision medicine. However, identifying features on which to base the predictions remains a challenge, especially when the sample size is small. Incorporating expert knowledge offers a promising alt…
We propose a novel {\it Equilibrated Recurrent Neural Network} (ERNN) to combat the issues of inaccuracy and instability in conventional RNNs. Drawing upon the concept of autapse in neuroscience, we propose augmenting an RNN with a time-delayed self-feedback loop. Our sole purpose is to modify the dynamics of each inte…
IAL uses interactive learning to improve model performance with minimal human feedback.
problem Overfitting and high human interaction cost in training neural networks.
method IAL framework with NAP attention generator and reranking algorithm.
result IAL significantly outperforms baselines with less retraining and human interaction.
FP uses random projections to train networks without feedback, achieving comparable performance to backpropagation.
problem Training neural networks without feedback from downstream layers.
method Forward Projection (FP) method that uses randomised nonlinear projections and closed-form regression.
result FP achieves comparable generalisation to backpropagation methods with a single forward pass, offering significant speedup.
Semi-supervised method enhances recommendation from sparse data.
problem Data sparsity in implicit feedbacks and lack of negative samples.
method Domain adaptation using textual features to align latent spaces.
result Our models significantly outperform existing models on real-world datasets.
Study improves online learning with adaptable agents in various settings.
problem Learning with improving agents in online settings.
method Extensive analysis of combinatorial dimensions, multiclass setup, bandit feedback, and agent cost.
result Characterization and analysis of online learnability in the model.
Proposes SSL framework for improving item recommendations in large-scale systems.
problem Sparse feedback data for long-tail items in recommender systems.
method Multi-task self-supervised learning framework with data augmentation.
result Significant improvements in model performance, especially on slices lacking supervision.
New approach mitigates feedback divergence in imitation learning.
problem Divergence between held-out error and learner performance in imitation learning.
method Identifies covariate shift as the root cause and proposes a simulator-based solution.
result Naive behavioral cloning performs well in real-world decision making problems.
One way to solve lasso problems when the dictionary does not fit into available memory is to first screen the dictionary to remove unneeded features. Prior research has shown that sequential screening methods offer the greatest promise in this endeavor. Most existing work on sequential screening targets the context of …
Rating Prediction is a basic problem in Recommender System, and one of the most widely used method is Factorization Machines(FM). However, traditional matrix factorization methods fail to utilize the benefit of implicit feedback, which has been proved to be important in Rating Prediction problem. In this work, we consi…
New algorithm mitigates affinity bias in hiring feedback loops.
problem Mitigating affinity bias in hiring decisions to avoid unconscious favoritism.
method Introducing affinity bandits, a new bandit variant that accounts for evolving biased feedback.
result Elimination-style algorithm nearly matches the derived regret bound, outperforming classical algorithms.
PSEUDo learns patterns in multivariate time series with locality-sensitive hashing and relevance feedback.
problem Efficient pattern detection in large, multi-track sequential data with high variance and lack of ground truth.
method Query-aware locality-sensitive hashing for feature learning, sub-linear training and inference time.
result PSEUDo achieves sub-linear time efficiency for pattern modeling and comparison of 10,000 multivariate time series.
Paper tackles binary feedbacks in contextual search learning.
problem Learning underlying mean value function in context with binary feedbacks.
method Tri-section search combined with margin-based active learning.
result Algorithm achieves O ( 1 / ε 2 ) O(1/\varepsilon^2) O ( 1/ ε 2 ) queries for ε ε ε -estimation accuracy. New framework selects key features for better query performance prediction.
problem Predict query performance without relevance judgments.
method Step-wise forward and backward feature selection approach.
result Model with selected features performs as well as complex models and better than non-selective models.
Algorithm minimizes regret in dueling bandits with contextualized utilities.
problem Minimizing regret in dueling bandits with context-dependent utilities.
method Proposes CoLSTIM algorithm based on perturbed utility estimates.
result Achieves regret of order i l d e O ( d T ) ilde O(\sqrt{dT}) i l d e O ( d T ) . Analysis of deep neural networks under various learning rules reveals dynamics of feature and prediction learning.
problem Understanding how different learning rules affect feature and prediction dynamics in deep neural networks.
method Analysis of infinite-width deep networks trained with gradient descent and various learning rules.
result The evolution of the output function is governed by an effective neural tangent kernel (eNTK), which varies depending on the learning rule and training regime.
We attempt to unveil the fine structure of volatility feedback effects in the context of general quadratic autoregressive (QARCH) models, which assume that today's volatility can be expressed as a general quadratic form of the past daily returns. The standard ARCH or GARCH framework is recovered when the quadratic kern…
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 agnostic feature-based dynamic pricing models with linear policies and noisy valuations.
problem Tackles dynamic pricing with unknown noise and no assumptions on data.
method Studies two agnostic models: linear policy and linear noisy valuation, presenting algorithms and regret bounds.
result Demonstrates no-regret learning is possible under weak assumptions, but noisy feedback is not significantly more useful than bandit feedback.
ESM-CNN uses error feedback to build a random CNN for time series forecasting.
problem Improving time series forecasting accuracy with CNNs.
method Incrementally adding random filters and neurons to adaptively construct a CNN.
result ESM-CNN outperforms state-of-the-art models in prediction accuracy and efficiency.
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.
The paper optimizes exceptions in a statistical production system using machine learning.
problem Lack of curated and labeled training data for machine learning in data quality assurance.
method Explainable supervised machine learning to identify and prioritize exceptions.
result Improvement in the quality and efficiency of exceptions generated and authenticated by users.
Algorithm achieves comparable performance to fully dynamic data with only a few batches.
problem High-dimensional multi-armed contextual bandits with batched feedback.
method Provable sample-efficient algorithm using batch allocation method.
result Achieves regret bounds comparable to fully sequential setting with only L = O(log T) batches.
Online reviews predict long-term stock returns.
problem Little research on predicting individual stock returns using online reviews.
method Selected 6,246 features from 18 million reviews; built prediction models with cross-validation.
result Achieved 13.94% accuracy improvement over existing methods.
Algorithm for online learning in MDPs with linear function approximation and bandit feedback.
problem Online learning in MDPs with changing reward functions and limited feedback.
method Developed MDP-LinExp3 algorithm with theoretical guarantees.
result Proved regret bounds for MDP-LinExp3 algorithm.
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…