NeurIPS 2026 reviews are up: reviews, scores, rebuttals and meta-reviews for 7,877 papers. See the highest rated
acceptodds: the papers of NeurIPS 2026
Abstract
The safe for work edition of acceptodds: the submissions, without the markets. Search them, browse them on a map laid out by what they are about, follow the ones you care about, keep reading lists with your group, and get recommendations from what you read. There are no odds, no bets and no reputation here. acceptodds is not affiliated with any organisation or institution. acceptodds is an open source project, open to contributions, at github.com/PotentialHedge/acceptodds-sfw.1 Follow for updates on X.
[abs]IDEA: Unwrapping Visual Black-box Models by Interaction DecompositionChaojie Ji, Jian Xu, He Zhang et al.4.50
[PDF]FastDSAC: Unlocking the Potential of Maximum Entropy RL in High-Dimensional Humanoid ControlJUN XUE, Junze Wang, Shanze Wang et al.4.50
[PDF]RATS! Patches Talk Through Registers: Emergent Parts in Register Attention TransformersTiming Yang, Predrag Neskovic, Jansen Seheult et al.4.50
[abs]Neural-DISCO: Source-Conditioned Counterfactual Editing of Neural Population ActivityNico Policzer, James Ho, Joseph Soo et al.4.50
[abs]Attention-Based Pretraining for Unsupervised Amortized Causal DiscoveryNaiyu Yin, Tian Gao, Yue Yu4.50
[abs]Bayesian Causal Experimental Design for CATE Estimation under NoncomplianceErdun Gao, Yuanyuan Wang, Liang Zhang et al.4.50
[abs]Class-Mixed Diffusion Augmentation for Shortcut-Breaking in Continual LearningAbhinab Acharya, Dayou Yu, Qi Yu et al.4.50
[abs]Aggregation Dispersion: An Information-Geometric Diagnostic of Oversmoothing in Graph Neural NetworksAbdessalam Ed-dib, Amine Aboussalah4.50
[abs]Hyperbolic Displacement-Constrained Adaptation for CLIP-Based Class-Incremental LearningQuan Cheng, Zhenhao Wen, Lan Li et al.4.50
[abs]Robust Residual Correction via Selective Deployment for Time Series ForecastingJianxiang Xie, YUNCHENG HUA, Mingyue Cheng et al.4.50
[PDF]METIS: Multi-Source Egocentric Training for Integrated Dexterous Vision-Language-Action ModelYankai Fu, Ning Chen, Junkai Zhao et al.4.50
[abs]Stable3R: Streaming 3D Reconstruction with Stable Geometric ReferencesJincheng Xiong, Jiarong Han, Hang Zhang et al.4.50
[abs]MaskSense: Confronting the Visual Exploration Trap in Masked Image GenerationYawen Shao, Jie Xiao, Kai Zhu et al.4.50
[abs]Learning Recoverable Neural Networks against Weight Corruption via Simple Zero-Sum ProjectionSanggeon Yun, Ryozo Masukawa, SungHeon Jeong et al.4.50
[PDF]Jump Start Your Policy Learning with Lessons from 145,000 Training RunsNabil Omi, Chung Yik Edward Yeung, Eric Bae et al.4.50
[abs]SitCom: Scaling Egocentric Multi-Party Spoken Dialogue for Situated Communication AssistanceHeeseung Yun, Sehun Lee, Sang Hoon Woo et al.4.50
[abs]Spectral Representations for Provably Robust Offline Meta-Reinforcement Learning from Bagged RewardsYashas Vaidya, Bo Dai4.50
[PDF]Stop the Sampler! Classifier-Based Adaptive Stopping for Sampling KernelsKirill Korolev, Nikita Morozov, Stepan Pavlenko et al.4.50
[abs]GEM: Interpretable Language Models via Geometric Embedding AlignmentDimitrios Tsaras, Yankun Hong, Lei Chen et al.4.50
[abs]Differentially Private Sparse Reward Estimation with Preference FeedbackMeng Ding, Mingxi Lei, Jie Zhang et al.4.50
[PDF]SkillGen: Verified Inference-Time Agent Skill SynthesisYuchen Ma, Yue Huang, Han Bao et al.4.50
[PDF]Reward-free Pretraining for Reinforcement Learning via Occupancy Coverage MaximizationMarco Pratticò, Pietro Novelli, Massimiliano Pontil et al.4.50
[PDF]I-Perceive: A Foundation Model for Vision-Language Active PerceptionYongxi Huang, Wang, Wenjing Tang et al.4.50
[PDF]One Algorithm, Two Goals: Dual Scoring for Parameter and Data Selection in LLM Fine-TuningXinrui Chen, Liu Yang, Ou Wu4.50
[abs]Robust Approximate Nearest Neighbor Search for Any DatasetAlexandr Andoni, Themistoklis Haris, Esty Kelman et al.4.50
[PDF]CITE: Anytime Valid Statistical Inference in LLM Self-ConsistencyHirofumi Ota, Naoto Iwase, Yuki Ichihara et al.4.50
[PDF]Flow-DPPO: Divergence Proximal Policy Optimization for Flow Matching ModelsBowen Ping, Xiangxin Zhou, Penghui Qi et al.4.50
[abs]Harder the Task, Sparser the Representation: Sparsity as a Learning Signature of Capability in LLMsMingyu Jin, Yutong Yin, Jingcheng Niu et al.4.50
[PDF]SEAR: Sample Efficient Action Chunking Reinforcement LearningC F Maximilian Nagy, Onur Celik, Emiliyan Gospodinov et al.4.50
[PDF]Full Attention Strikes Back: Transferring Full Attention into Sparse within Hundred Training StepsYanke Zhou, Yiduo Li, Hanlin Tang et al.4.50
[PDF]Reliable Abstention under Adversarial Injections: Lower Bounds and New Upper BoundsEzra Edelman, Surbhi Goel4.50
[abs]Matrix Recovery Via Symmetric Rank-one Measurements With Random Unit-modulus VectorsTongyu Zhou, Wei Zhang4.50
[PDF]Brenier Meets Adversarial Training: Optimal Transport Geometry for Robust Learningalireza abdollahpour, Ehsan Sharifian, Buse Şen et al.4.50
[PDF]GIST: Gauge-Invariant Spectral Transformers for Scalable Graph Neural OperatorsMattia Rigotti, Nicholas Thumiger, Thomas Frick4.50
[abs]Beyond Proxy Metrics: MLLM-Based Human Surrogate Evaluation for Explainable AIEoin Kenny, Salim I. Amoukou, Tom Bewley4.50
[PDF]SGD Provably Prioritizes a Shortcut Spurious Feature in the XOR ModelTyler LaBonte, Vidya Muthukumar4.50
[PDF]AVO: Agentic Variation Operators for Autonomous Evolutionary SearchTerry Chen, Zhifan Ye, Bing Xu et al.4.50
[PDF]LIME: Link-based User-item Interaction Modeling with Decoupled XOR Attention for Efficient Test Time ScalingYunjiang Jiang, Ayush Agarwal, Yang Liu et al.4.50
[PDF]SMI: Statistical Membership Inference for Reliable Unlearned Model AuditingJialong Sun, Zeming Wei, Jiaxuan Zou et al.4.50
[abs]Towards Identifying Dominant Low-Rank Subspaces in Zeroth-Order Fine-TuningJinjie Fang, Chengxun Jin, Yi Chang et al.4.50
[abs]Incorporating Neural Network Structure in the Bayesian Learning RuleEiki Shimizu, Mohammad Emtiyaz Khan, Thomas Möllenhoff4.50
[PDF]ODDR: One-Step Deshadow Diffusion via Reward GuidanceJunseong Shin, Kijun Kim, Minseong Kim et al.4.50
1 If this project is interesting to you, reach out at [email protected].