acceptodds: the papers of ICLR 2027
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.
[PDF]Make Every Bit Count: Residual Capacity Reallocation for Unsupervised Cross-Modal Hashing▲233.33
[PDF]T3lescope: Arbitrary-Resolution High-Fidelity Generative Surface Reconstruction from Images▲1.7k3.33
[PDF]Measuring Progress in Reasoning Toward Mathematical Discovery with Automatic Verification▲1.7k3.33
[PDF]LUMEN-GS: Towards Light-Disentangled and Intrinsic-Aware Gaussian Splatting for Feed-forward Sparse-View Street Reconstruction▲233.33
[PDF]On the Sample Complexity of Language Generation in the Limit with Noise, Prompts, and Feedback▼2373.33
[PDF]Efficiency and robustness partition the solution space for memory in recurrent networks▼2373.33
[PDF]Vanilla Policy Optimization Is Both Optimal and Differentially Private for Stochastic Contextual Bandits▲233.33
[PDF]Complex Phase Retrieval via Conditional Quantiles: Finite-Sample Recovery without Noise Moments▲233.33
[PDF]Ordinal Predictions Suffice for Non-Clairvoyant Scheduling: Closing the Gap in the Consistency–Robustness Trade-off▲233.33
[PDF]Query Complexity of Eliciting Consensus Lotteries with Bounded Adaptivity and Parallelism▲233.33
1 If this project is interesting to you, reach out at [email protected].