NeurIPS 2026 reviews are up: reviews, scores, rebuttals and meta-reviews for 7,877 papers. See the highest rated
acceptodds: the papers of ICLR 2027
465 results for “keyword:"rts"” in ICLR 2027. 97 withdrawn or desk rejected listed apart. clearsort:relevanceratingnewestmost read
[PDF]UAR-LoRA: Uncertainty-Aware Rank-Adaptive Low-Rank Adaptation for Lifelong Knowledge Editing▼1.2k1.67
[PDF]When Do RTL Verifiers Lie? Measuring Proxy-Reward Overoptimization in LLM Hardware Design▼4.5k2.67
[PDF]PRIMO: Pareto-Optimal Information-Constrained Compression for Mixture-of-Experts Language Models▲6.1k2.00
[PDF]AtomShare: One Shared Atom Set Across a Mixture-of-Experts Stack for Budget-Constrained Weight Compression▼71.25
[PDF]When Can Pairwise Routing Dynamics Be Tested in Mixture-of-Experts? Identifiability Conditions and Evidence from a Learned Router▼1361.33
[PDF]Confluence: WHEN DOES CONSERVED-FLOW ROUTING HELP? A COUPLING CONDITION FOR MIXTURE-OF-EXPERTS, WITH A LEGALITY GUARANTEE▼1361.33
[PDF]HEPH: 3-Bit Grid-Aligned Trellis Quantization of MXFP4 Mixture-of-Experts for Accurate, Hadamard-Free Serving▲20k2.67
[PDF]Mixture-of-Experts Routing Responses Are Strong Signals for AI-Generated Text Detection▼4.3k2.00
[PDF]RouteVerify: Routing Interventions for Step-Level Verification in Mixture-of-Experts Models▲3.0k2.33
[PDF]One Size Doesn't Fit All: Depth-aware Manifold-Gated Mixture-of-Experts for Deep Imbalanced Regression▼20k1.67
[PDF]TimeSWARM: Soft Weighted Assignment-Based Relational Modeling of Channel-Patches for Multivariate Time Series Classification▼4.3k2.00
[PDF]MoE-PACT: Confidential MoE Inference via Searched Bit Partitioning and Optimal Clustering of Expert Tensors▼5.8k2.33
[PDF]Just Reuse the Rollout Log-Probs: Stable Mixture-of-Experts Reinforcement Learning with a Vocabulary-KL Clip▼5.8k2.33
[PDF]LiteMoE: Lightweight Multi-Layer Predictive Expert Preloading and Task-Aware MoE Inference▼4.3k2.00
[PDF]Batch-Aware Hierarchical Routing for Mixture-of-Experts with Reduced Memory Traffic and Theoretical Guarantees▼1.2k1.67
[PDF]Unmasking the Hidden Bias, Fairness, and Safety Costs of Compression with Mixture-of-Expert Models▼1.2k3.00
[PDF]Phase-MoE: A Co-Design to Bound the Expert Explosion in Block Diffusion Language Models▼4.3k2.00
[PDF]Same Counts, Different Cost: Measuring the Order Gap in Sparse Mixture-of-Experts Routing▼1361.33
[PDF]ROUTING SHUFFLES DO NOT IDENTIFY ADAPTIVE BENEFIT: THEORY AND A CONTROLLED ACM-GCN AUDIT▼1361.33
[PDF]BEYOND OVERLAP: OS-AWARE, BANDWIDTH-CENTRIC EXPERT STREAMING FOR MOE INFERENCE ON UNIFIED-MEMORY SYSTEMS▲3952.67
[PDF]AMIYC: Add Me if You Can Conditional Adaptation Headroom and Recovery in Evolving MMoEs▼1361.33
[PDF]ULMoE: Algorithm-System Co-design for Efficient Ultra-Low-Bit MoE Compression and Serving▼4.5k2.67
[PDF]The Strong, weak and benign Goodhart's law: An independence-free and paradigm-agnostic formalisation▲5.4k3.00
[PDF]Know Before You Route: Dual-Signal Expert Prefetching with Conformal Coverage Guarantees for Sparse MoE LLMs▲3952.67
Withdrawn or desk rejected (97)
[PDF]Exploring Expert Concentration for Parameter-efficient Fine-tuning of Mixture-of-Expert LLMsWithdrawn1.67
[PDF]CCQ: Compensation-Conditioned Quadratic Selection for Absorbing Skipped Experts in MoE LLMsWithdrawn2.00
[PDF]The Price of Hidden Assignments: Calibration and Minimax Rates in Pooled CATE LearningWithdrawn1.33
[PDF]SurroGate: Efficient Text-to-Image Routing via Continuous Generative Profiling in Sparse MoEsDesk rejected