Saved in:
| Main Author: | Casanova, Juan |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.19742 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Optimal community detection in dense bipartite graphs
by: Chhor, Julien, et al.
Published: (2025)
by: Chhor, Julien, et al.
Published: (2025)
Sampling by averaging: A multiscale approach to score estimation
by: Cordero-Encinar, Paula, et al.
Published: (2025)
by: Cordero-Encinar, Paula, et al.
Published: (2025)
An efficient search-and-score algorithm for ancestral graphs using multivariate information scores
by: Lagrange, Nikita, et al.
Published: (2024)
by: Lagrange, Nikita, et al.
Published: (2024)
Understanding and mitigating difficulties in posterior predictive evaluation
by: Agrawal, Abhinav, et al.
Published: (2024)
by: Agrawal, Abhinav, et al.
Published: (2024)
Transcoders Beat Sparse Autoencoders for Interpretability
by: Paulo, Gonçalo, et al.
Published: (2025)
by: Paulo, Gonçalo, et al.
Published: (2025)
Decentralized Asynchronous Multi-player Bandits
by: Fan, Jingqi, et al.
Published: (2025)
by: Fan, Jingqi, et al.
Published: (2025)
RisingBALLER: A player is a token, a match is a sentence, A path towards a foundational model for football players data analytics
by: Adjileye, Akedjou Achraff
Published: (2024)
by: Adjileye, Akedjou Achraff
Published: (2024)
Beat Tracking as Object Detection
by: Ahn, Jaehoon, et al.
Published: (2025)
by: Ahn, Jaehoon, et al.
Published: (2025)
Robust Sublinear Convergence Rates for Iterative Bregman Projections
by: Peyré, Gabriel
Published: (2026)
by: Peyré, Gabriel
Published: (2026)
Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
by: Vaidyan, Kevin Kurian Thomas, et al.
Published: (2026)
by: Vaidyan, Kevin Kurian Thomas, et al.
Published: (2026)
Beating Transformers using Synthetic Cognition
by: Ibias, Alfredo, et al.
Published: (2025)
by: Ibias, Alfredo, et al.
Published: (2025)
Rate doubly robust estimation for weighted average treatment effects
by: Wang, Yiming, et al.
Published: (2025)
by: Wang, Yiming, et al.
Published: (2025)
Generating Realistic Multi-Beat ECG Signals
by: Pöhl, Paul, et al.
Published: (2025)
by: Pöhl, Paul, et al.
Published: (2025)
Variational phylogenetic inference with products over bipartitions
by: Sidrow, Evan, et al.
Published: (2025)
by: Sidrow, Evan, et al.
Published: (2025)
Interactive and Hybrid Imitation Learning: Provably Beating Behavior Cloning
by: Li, Yichen, et al.
Published: (2024)
by: Li, Yichen, et al.
Published: (2024)
Semantic Tube Prediction: Beating LLM Data Efficiency with JEPA
by: Huang, Hai, et al.
Published: (2026)
by: Huang, Hai, et al.
Published: (2026)
Achilles' Heel of Mamba: Essential difficulties of the Mamba architecture demonstrated by synthetic data
by: Chen, Tianyi, et al.
Published: (2025)
by: Chen, Tianyi, et al.
Published: (2025)
A fast score-based search algorithm for maximal ancestral graphs using entropy
by: Hu, Zhongyi, et al.
Published: (2024)
by: Hu, Zhongyi, et al.
Published: (2024)
Beat the long tail: Distribution-Aware Speculative Decoding for RL Training
by: Shao, Zelei, et al.
Published: (2025)
by: Shao, Zelei, et al.
Published: (2025)
Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback
by: Liu, Haolin, et al.
Published: (2024)
by: Liu, Haolin, et al.
Published: (2024)
Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines?
by: Korznikov, Anton, et al.
Published: (2026)
by: Korznikov, Anton, et al.
Published: (2026)
SmartSearch: How Ranking Beats Structure for Conversational Memory Retrieval
by: Derehag, Jesper, et al.
Published: (2026)
by: Derehag, Jesper, et al.
Published: (2026)
A survey on multi-player bandits
by: Boursier, Etienne, et al.
Published: (2022)
by: Boursier, Etienne, et al.
Published: (2022)
Beating the Winner's Curse via Inference-Aware Policy Optimization
by: Bastani, Hamsa, et al.
Published: (2025)
by: Bastani, Hamsa, et al.
Published: (2025)
Fairness of Deep Ensembles: On the interplay between per-group task difficulty and under-representation
by: Claucich, Estanislao, et al.
Published: (2025)
by: Claucich, Estanislao, et al.
Published: (2025)
Forecasting the future development in quality and value of professional football players
by: van Arem, Koen W., et al.
Published: (2025)
by: van Arem, Koen W., et al.
Published: (2025)
Don't Label Twice: Quantity Beats Quality when Comparing Binary Classifiers on a Budget
by: Dorner, Florian E., et al.
Published: (2024)
by: Dorner, Florian E., et al.
Published: (2024)
Can LLMs Beat Classical Hyperparameter Optimization Algorithms? A Study on autoresearch
by: Ferreira, Fabio, et al.
Published: (2026)
by: Ferreira, Fabio, et al.
Published: (2026)
Lazy vs hasty: linearization in deep networks impacts learning schedule based on example difficulty
by: George, Thomas, et al.
Published: (2022)
by: George, Thomas, et al.
Published: (2022)
Deep SOR Minimax Q-learning for Two-player Zero-sum Game
by: Gautam, Saksham, et al.
Published: (2025)
by: Gautam, Saksham, et al.
Published: (2025)
"Calibeating": Beating Forecasters at Their Own Game
by: Foster, Dean P., et al.
Published: (2022)
by: Foster, Dean P., et al.
Published: (2022)
Online bipartite matching with imperfect advice
by: Choo, Davin, et al.
Published: (2024)
by: Choo, Davin, et al.
Published: (2024)
Iteration and Stochastic First-order Oracle Complexities of Stochastic Gradient Descent using Constant and Decaying Learning Rates
by: Imaizumi, Kento, et al.
Published: (2024)
by: Imaizumi, Kento, et al.
Published: (2024)
Beat this! Accurate beat tracking without DBN postprocessing
by: Foscarin, Francesco, et al.
Published: (2024)
by: Foscarin, Francesco, et al.
Published: (2024)
The Art of Beating the Odds with Predictor-Guided Random Design Space Exploration
by: Arnold, Felix, et al.
Published: (2025)
by: Arnold, Felix, et al.
Published: (2025)
Random Is Hard to Beat: Active Selection in online DPO with Modern LLMs
by: Oh, Giyeong, et al.
Published: (2026)
by: Oh, Giyeong, et al.
Published: (2026)
Routing Absorption in Sparse Attention: Why Random Gates Are Hard to Beat
by: Aquino-Michaels, Keston
Published: (2026)
by: Aquino-Michaels, Keston
Published: (2026)
Substance Beats Style: Why Beginning Students Fail to Code with LLMs
by: Lucchetti, Francesca, et al.
Published: (2024)
by: Lucchetti, Francesca, et al.
Published: (2024)
What makes a word hard to learn? Modeling L1 influence on English vocabulary difficulty
by: Martins, Jonas Mayer, et al.
Published: (2026)
by: Martins, Jonas Mayer, et al.
Published: (2026)
Cross-attention-based bipartite graph neural network for coupled nodal and elemental field prediction in large-deformation sheet material forming
by: Zhao, Yingxue, et al.
Published: (2026)
by: Zhao, Yingxue, et al.
Published: (2026)
Similar Items
-
Optimal community detection in dense bipartite graphs
by: Chhor, Julien, et al.
Published: (2025) -
Sampling by averaging: A multiscale approach to score estimation
by: Cordero-Encinar, Paula, et al.
Published: (2025) -
An efficient search-and-score algorithm for ancestral graphs using multivariate information scores
by: Lagrange, Nikita, et al.
Published: (2024) -
Understanding and mitigating difficulties in posterior predictive evaluation
by: Agrawal, Abhinav, et al.
Published: (2024) -
Transcoders Beat Sparse Autoencoders for Interpretability
by: Paulo, Gonçalo, et al.
Published: (2025)