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.
This study improves fast non-Bayesian Poisson factorization for implicit-feedback recommendation systems.
problem Improving recommendation quality and speed for implicit-feedback data.
method Regularized Poisson models, frequentist optimization, sparse solutions.
result Frequentist approach yields better top-N recommendations with shorter fitting times.
Method converts sparse systems to dense ones for statistical mechanics problems.
problem Statistical mechanics on sparse graphs
method Extracts a Feedback Vertex Set, learns variational distribution, estimates free energy.
result More accurate and faster than existing methods for sparse systems.
Proposes CF-SFL to improve sparse data recommendation.
problem Poor performance of CF in sparse data.
method Generative user feedback loop to simulate user feedback.
result Improves recommendation results on multiple datasets.
Direct feedback alignment reduces data movement in neural networks.
problem Efficiency and energy-efficiency in training large neural networks.
method Sparse feedback matrix for local learning, reducing data movement and compute.
result Orders of magnitude improvement in data movement and 2x improvement in multiply-and-accumulate operations.
Simple linear model outperforms deep models on sparse data.
problem Sparse data in recommender systems.
method Linear autoencoder with closed-form solution.
result Simple model achieves better ranking accuracy than deep models.
Dynamic model pruning improves performance on deep neural networks without retraining.
problem High memory and latency requirements for deep neural networks on low-end devices.
method Dynamic allocation of sparsity pattern and feedback signal to reactivate pruned weights.
result Sparse models achieve state-of-the-art performance with no additional retraining.
Improves reinforcement learning for complex tasks with sparse feedback.
problem Learning optimal policies from sparse feedback is challenging.
method Three algorithms based on Hindsight Experience Replay (HER) to improve performances.
result Vast improvement in final success rate and sample efficiency.
Deep COACH learns complex tasks from human feedback in Minecraft.
problem Learning complex behaviors from human feedback efficiently.
method Deep reinforcement learning with policy updates based on human critiques.
result Demonstrated effectiveness in Minecraft with reduced sample complexity.
MeRL learns from sparse, underspecified rewards by discounting spurious trajectories.
problem Learning from binary success-failure feedback with little context.
method MeRL uses KL divergence to collect diverse successful trajectories and optimize an auxiliary reward function.
result MeRL outperforms alternative reward learning techniques and achieves state-of-the-art performance.
Proposes a model to classify nodes in networks using weighted feedback relations.
problem Challenges in predicting node labels in sparse networks with implicit feedback.
method Weighted personalized two-stage matrix factorization model with Bayesian ranking loss.
result Significantly outperforms state-of-the-art models on various datasets.
Physics-informed GCRL tackles sparse feedback learning with hybrid dynamics.
problem Sparse feedback learning with high-dimensional, hybrid, or contact-dependent dynamics.
method Introduces physics-informed inductive biases into goal-conditioned value learning.
result Contact-rich manipulation tasks degrade existing Pi-GCRL methods.
h-DQN integrates hierarchical value functions with intrinsic motivation for efficient exploration.
problem Sparse feedback and insufficient exploration in reinforcement learning.
method Hierarchical-DQN framework combining temporal abstraction and intrinsic motivation.
result Demonstrated efficiency in exploration and task-solving on sparse feedback problems.
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.
Enhances on-policy RL with past reward statistics and hot-wiring.
problem Challenges of sparse reward signals in on-policy methods.
method Multi-critic supervision and hot-wiring mechanism.
result Improves on-policy learning for sparse reward tasks.
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.
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.
A recipe recommendation system suggests missing ingredients using collaborative filtering.
problem Encouraging healthy diets through personalized ingredient suggestions.
method Item-based collaborative filtering applied to a sparse dataset of recipes.
result Best method achieves a recall@10 of circa 40%.
Proposes a robust framework for recommendation with implicit feedback considering cost-sensitive learning.
problem Recommendation with implicit feedback often assumes a strict low-rank structure and ignores class imbalance.
method Decomposes U-I matrix into low-rank and sparse components, incorporating cost-sensitive learning.
result Cost-sensitive error is upper bounded by O ( α m n ) O(\fracα{\sqrt{mn}}) O ( mn α ) , demonstrating improved performance. IDS improves reinforcement learning with contextual information.
problem Optimizing IDS for contextual reinforcement learning.
method Investigated contextual bandit problems and proposed a computationally-efficient IDS.
result Contextual IDS outperforms conditional IDS by considering future contexts.
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.
This work enhances curiosity-driven exploration in reinforcement learning.
problem Sparse or insufficient extrinsic feedback in real-world scenarios.
method Probabilistic attention mechanism combined with Actor-Critic framework and ICM.
result New methods improve agent performance in reinforcement learning tasks.
A new method shapes reinforcement learning environments by abstracting large state spaces.
problem Learning in large, noisy environments with sparse feedback.
method Environment shaping using state abstraction.
result Agent's policy in shaped environment preserves near-optimal behavior in original environment.
Variational Proximal Policy Optimization improves reinforcement learning from human feedback.
problem Policy mode collapse and brittle exploration loops in reinforcement learning.
method Particle-based variational inference framework with Mixture-of-Experts architecture.
result Significant improvements in complex reasoning benchmarks.
PopArt efficiently solves sparse linear bandits with tighter recovery guarantees.
problem Sparse linear bandits where rewards depend on a few covariates.
method PopArt: a simple, computationally efficient sparse linear estimation method.
result Improved regret bounds compared to state-of-the-art algorithms.
The paper improves DFA for CNN and RNN training to match BP accuracy.
problem Low accuracy in CNN and RNN training using DFA.
method Divide network into modules, apply DFA within, use sparse backward weight, and incorporate dilated convolution and sparse matrix multiplication.
result Achieves BP-level accuracy in CNN and RNN training.
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.
Efficiently trains autoencoders for collaborative filtering on large datasets.
problem Training autoencoders on large, sparse implicit feedback datasets.
method Mini-batch based negative sampling for large-scale training.
result Shows improved performance compared to state-of-the-art baseline models.
The paper explores a Multi-Objective RL approach for trading that generalizes reward functions.
problem Improving performance in single-asset trading through adaptive reward functions.
method Developed a Multi-Objective Deep Reinforcement Learning algorithm to generalize reward functions and discount factors.
result The Multi-Objective algorithm demonstrates increased predictive stability and better performance in sparse reward scenarios.
New RL method uses distance between states instead of rewards for sparse reward environments.
problem Sparse rewards or non-reward environments in reinforcement learning.
method Uses goal-distance gradient and bridge point planning for policy improvement.
result Significantly better performance on sparse reward and local optimal problems in complex environments.
Improves content allocation in educational platforms with sparse data.
problem Imbalanced content allocation and delayed convergence in adaptive strategies.
method Introduces WAPTS, an algorithm that refines Thompson Sampling for data-sparse environments.
result Demonstrates earlier and more reliable identification of promising treatments.
BCCP uses bandit feedback to provide reliable predictions with limited labeled data.
problem Limited labeled data and bandit feedback challenge online set-valued classification.
method BCCP uses stochastic gradient descent to train model and make set-valued inferences with unbiased estimation of true label.
result BCCP offers coverage guarantees on a class-specific granularity.
Deep sparse coding models resist adversarial examples.
problem Adversarial examples can fool deep learning models.
method Used deep sparse coding models to resist adversarial examples.
result Deep sparse coding models are robust to adversarial examples.
Efficiently poisons offline RLHF models by flipping preference labels.
problem Vulnerability of offline RLHF models to preference label flipping attacks.
method Developed two attack methods: BAL-A and BMP-A, solving a structured binary sparse approximation problem.
result Demonstrated that flipping one preference label induces a parameter-independent shift in the DPO gradient, enabling structured binary sparse approximation.
New method reduces regret for sparse adversarial SSP problems.
problem Sparse adversarial Stochastic Shortest Path problem.
method Proposed ℓ r \ell_r ℓ r -norm regularizers for adaptive sparsity. result Regret scales with log M \sqrt{\log M} log M instead of log S A \sqrt{\log SA} log S A . EFS uses LLMs to optimize sparse portfolios by evolving alpha factors.
problem Sparse portfolio optimization in dynamic market regimes.
method Evolutionary feedback loop with LLM-generated alpha factors.
result Significantly outperforms baselines in diverse datasets.
SIBRE boosts reinforcement learning convergence by rewarding improvement over past performance.
problem Improving the rate of convergence in reinforcement learning.
method SIBRE is a reward shaping approach that rewards improvement over the agent's own past performance.
result SIBRE converges faster and more stably to the optimal policy compared to baseline RL algorithms.
New approach improves cross-domain recommendation for sparse target domains.
problem Cross-domain recommendation challenges with sparse target domains.
method Guided neural collaborative filtering with domain-invariant components across dense and sparse domains.
result Effective and scalable approach demonstrated on public and Visa datasets.
Estimates parameters of high-dimensional Bernoulli autoregressive process with long-range dependence.
problem Estimating parameters of a multivariate Bernoulli process with auto-regressive feedback in high dimensions.
method Proposes and analyzes an ℓ 1 \ell_1 ℓ 1 -regularized maximum likelihood estimator (MLE) under the assumption of approximate sparsity. result Derives precise upper bounds on mean-squared estimation error.
Transforming sparse outcomes into dense process rewards for efficient reinforcement learning.
problem Training RL policies to maximize sparse outcomes.
method Incentivizing policy matching state-action visitations of successful episodes.
result Significantly faster RL finetuning performance.
DisCor corrects reinforcement learning issues by re-weighting collected data.
problem Reinforcement learning algorithms struggle with instability and sensitivity to hyperparameters.
method DisCor reweights collected data to mitigate issues caused by the distribution of experience.
result DisCor improves reinforcement learning in challenging settings like multi-task learning and noisy reward signals.
A new method for online prediction uncertainty quantification in non-exchangeable panel data.
problem Challenges in quantifying predictive uncertainty for non-exchangeable panel data.
method Online conformal prediction framework for non-exchangeable panel data, using similarity weights and adaptive miscoverage levels.
result Improves coverage on worst-covered target units through adaptive interval-width allocation.
A new algorithm RTO integrates DPO and PPO for RLHF, improving performance.
problem Learning from sparse, sentence-level rewards in RLHF.
method Modeling RLHF as MDP, introducing RTO that learns token-wise reward function.
result RTO outperforms PPO on benchmarks by 7.5 points on AlpacaEval 2 and 4.1 points on Arena-Hard.
Paper proposes RRD to learn proxy rewards for sparse delayed rewards in episodic reinforcement learning.
problem Learning from sparse and delayed rewards in reinforcement learning.
method Randomized Return Decomposition (RRD) algorithm to redistribute rewards.
result Substantial improvement over baseline algorithms in experiments.
New framework combines imitation and reinforcement learning for faster, cheaper decision-making.
problem Sequential decision-making with sparse rewards and long time horizons.
method Hierarchical guidance framework integrating imitation and reinforcement learning at different levels.
result Significantly faster and more label-efficient learning compared to existing methods.
A new approach for deep exploration in sparse reward reinforcement learning.
problem Slow or no learning in reinforcement learning with rare rewards.
method Long-term visitation count planning and decoupling exploration and exploitation.
result Significantly outperforms existing methods in sparse reward environments.
Algorithm optimizes collaborative learning among distributed clients using kernel-based bandits.
problem Optimizing personalized objectives in a distributed system with limited global information.
method Kernel-based bandit framework with surrogate Gaussian process models, sparse approximations.
result Order-optimal regret performance (up to polylogarithmic factors) and reduced communication overhead.
Self-imitation learning improves RL in sparse, episodic reward settings.
problem Suboptimal performance of RL algorithms in sparse or episodic reward settings.
method Formulate policy optimization as a divergence minimization problem using Jensen-Shannon divergence, and learn shaped rewards from experience replays.
result Our algorithm performs comparably to existing algorithms in dense reward settings and significantly better in sparse and episodic reward settings.