Reward Distance Comparisons Under Transition Sparsity
Fuente:
arXiv
Saved in:
| Main Authors: | Nyanhongo, Clement, Henrique, Bruno Miranda, Santos, Eugene |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Auxiliary Reward Generation with Transition Distance Representation Learning
by: Li, Siyuan, et al.
Published: (2024)
by: Li, Siyuan, et al.
Published: (2024)
Dynamic Trust Calibration Using Contextual Bandits
by: Henrique, Bruno M., et al.
Published: (2025)
by: Henrique, Bruno M., et al.
Published: (2025)
Understanding and Exploiting Weight Update Sparsity for Communication-Efficient Distributed RL
by: Miahi, Erfan, et al.
Published: (2026)
by: Miahi, Erfan, et al.
Published: (2026)
Wasserstein Distances, Neuronal Entanglement, and Sparsity
by: Sawmya, Shashata, et al.
Published: (2024)
by: Sawmya, Shashata, et al.
Published: (2024)
Detecting Hidden Triggers: Mapping Non-Markov Reward Functions to Markov
by: Hyde, Gregory, et al.
Published: (2024)
by: Hyde, Gregory, et al.
Published: (2024)
Efficient Reward Identification In Max Entropy Reinforcement Learning with Sparsity and Rank Priors
by: Shehab, Mohamad Louai, et al.
Published: (2025)
by: Shehab, Mohamad Louai, et al.
Published: (2025)
Reward Under Attack: Analyzing the Robustness and Hackability of Process Reward Models
by: Tiwari, Rishabh, et al.
Published: (2026)
by: Tiwari, Rishabh, et al.
Published: (2026)
The Distributional Reward Critic Framework for Reinforcement Learning Under Perturbed Rewards
by: Chen, Xi, et al.
Published: (2024)
by: Chen, Xi, et al.
Published: (2024)
Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds
by: Bonet, Clément, et al.
Published: (2024)
by: Bonet, Clément, et al.
Published: (2024)
Sparsity Forcing: Reinforcing Token Sparsity of MLLMs
by: Chen, Feng, et al.
Published: (2025)
by: Chen, Feng, et al.
Published: (2025)
Revisiting Sparsity Constraint Under High-Rank Property in Partial Multi-Label Learning
by: Si, Chongjie, et al.
Published: (2025)
by: Si, Chongjie, et al.
Published: (2025)
Hilbert Curve Projection Distance for Distribution Comparison
by: Li, Tao, et al.
Published: (2022)
by: Li, Tao, et al.
Published: (2022)
Overcoming Sparsity Artifacts in Crosscoders to Interpret Chat-Tuning
by: Minder, Julian, et al.
Published: (2025)
by: Minder, Julian, et al.
Published: (2025)
Distance Functions and Normalization Under Stream Scenarios
by: Barboza, Eduardo V. L., et al.
Published: (2023)
by: Barboza, Eduardo V. L., et al.
Published: (2023)
Weight Concentration Regularization for Improving Pruning Robustness Under High Sparsity
by: Yun, Vincent-Daniel, et al.
Published: (2025)
by: Yun, Vincent-Daniel, et al.
Published: (2025)
Sparsity in neural networks can improve their privacy
by: Gonon, Antoine, et al.
Published: (2023)
by: Gonon, Antoine, et al.
Published: (2023)
Empowering Distributed Training with Sparsity-driven Data Synchronization
by: Wang, Zhuang, et al.
Published: (2023)
by: Wang, Zhuang, et al.
Published: (2023)
Activity Sparsity Complements Weight Sparsity for Efficient RNN Inference
by: Mukherji, Rishav, et al.
Published: (2023)
by: Mukherji, Rishav, et al.
Published: (2023)
Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions
by: Indyk, Piotr, et al.
Published: (2025)
by: Indyk, Piotr, et al.
Published: (2025)
Logarithmic Regret of Exploration in Average Reward Markov Decision Processes
by: Boone, Victor, et al.
Published: (2025)
by: Boone, Victor, et al.
Published: (2025)
Learning Causally Invariant Reward Functions from Diverse Demonstrations
by: Ovinnikov, Ivan, et al.
Published: (2024)
by: Ovinnikov, Ivan, et al.
Published: (2024)
When Distance Distracts: Representation Distance Bias in BT-Loss for Reward Models
by: Xie, Tong, et al.
Published: (2025)
by: Xie, Tong, et al.
Published: (2025)
RewardBench: Evaluating Reward Models for Language Modeling
by: Lambert, Nathan, et al.
Published: (2024)
by: Lambert, Nathan, et al.
Published: (2024)
TimeRewarder: Learning Dense Reward from Passive Videos via Frame-wise Temporal Distance
by: Liu, Yuyang, et al.
Published: (2025)
by: Liu, Yuyang, et al.
Published: (2025)
MIND: Monge Inception Distance for Generative Models Evaluation
by: Berthet, Quentin, et al.
Published: (2026)
by: Berthet, Quentin, et al.
Published: (2026)
Which Rewards Matter? Reward Selection for Reinforcement Learning under Limited Feedback
by: Chaudhari, Shreyas, et al.
Published: (2025)
by: Chaudhari, Shreyas, et al.
Published: (2025)
Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity
by: Yin, Lu, et al.
Published: (2023)
by: Yin, Lu, et al.
Published: (2023)
Investigating Sparsity in Recurrent Neural Networks
by: Darji, Harshil
Published: (2024)
by: Darji, Harshil
Published: (2024)
Pairwise Comparisons without Stochastic Transitivity: Model, Theory and Applications
by: Lee, Sze Ming, et al.
Published: (2025)
by: Lee, Sze Ming, et al.
Published: (2025)
Forecasting MBTA Transit Dynamics: A Performance Benchmarking of Statistical and Machine Learning Models
by: Nalamalpu, Sai Siddharth, et al.
Published: (2025)
by: Nalamalpu, Sai Siddharth, et al.
Published: (2025)
Improving Decision Sparsity
by: Sun, Yiyang, et al.
Published: (2024)
by: Sun, Yiyang, et al.
Published: (2024)
Homeostasis and Sparsity in Transformer
by: Kotyuzanskiy, Leonid, et al.
Published: (2024)
by: Kotyuzanskiy, Leonid, et al.
Published: (2024)
Polar Sparsity: High Throughput Batched LLM Inferencing with Scalable Contextual Sparsity
by: Shrestha, Susav, et al.
Published: (2025)
by: Shrestha, Susav, et al.
Published: (2025)
Graph Neural Networks for Travel Distance Estimation and Route Recommendation Under Probabilistic Hazards
by: Liu, Tong, et al.
Published: (2025)
by: Liu, Tong, et al.
Published: (2025)
Black Box Meta-Learning Intrinsic Rewards
by: Pappalardo, Octavio, et al.
Published: (2024)
by: Pappalardo, Octavio, et al.
Published: (2024)
Certified Robustness Under Bounded Levenshtein Distance
by: Rocamora, Elias Abad, et al.
Published: (2025)
by: Rocamora, Elias Abad, et al.
Published: (2025)
Restless Bandit Problem with Rewards Generated by a Linear Gaussian Dynamical System
by: Gornet, Jonathan, et al.
Published: (2024)
by: Gornet, Jonathan, et al.
Published: (2024)
Spark Transformer: Reactivating Sparsity in FFN and Attention
by: You, Chong, et al.
Published: (2025)
by: You, Chong, et al.
Published: (2025)
SPADE-S: A Sparsity-Robust Foundational Forecaster
by: Wolff, Malcolm, et al.
Published: (2025)
by: Wolff, Malcolm, et al.
Published: (2025)
Hyperbolic Aware Minimization: Implicit Bias for Sparsity
by: Jacobs, Tom, et al.
Published: (2025)
by: Jacobs, Tom, et al.
Published: (2025)
Similar Items
-
Auxiliary Reward Generation with Transition Distance Representation Learning
by: Li, Siyuan, et al.
Published: (2024) -
Dynamic Trust Calibration Using Contextual Bandits
by: Henrique, Bruno M., et al.
Published: (2025) -
Understanding and Exploiting Weight Update Sparsity for Communication-Efficient Distributed RL
by: Miahi, Erfan, et al.
Published: (2026) -
Wasserstein Distances, Neuronal Entanglement, and Sparsity
by: Sawmya, Shashata, et al.
Published: (2024) -
Detecting Hidden Triggers: Mapping Non-Markov Reward Functions to Markov
by: Hyde, Gregory, et al.
Published: (2024)