---
title: "NeurIPS 2023 — all accepted papers, page 34 — Elamur Research"
description: "All 3,540 papers of NeurIPS 2023 · page 34 of 36, the most cited first; those with our summary link to it."
canonical: "https://research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/34/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/34/)

[home](https://md.research.elamur.ai/free/en/) / [venues](https://md.research.elamur.ai/free/en/venues/) / [NeurIPS](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/) / [2023](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/) / [papers](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/) / page 34

# NeurIPS 2023: all accepted papers

3,540 papers · page 34 of 36 · the most cited first · [← NeurIPS 2023](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/)

[← prev](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/33/) [1](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/) … [30](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/30/) … [33](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/33/) **34** [35](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/35/) [36](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/36/) [next →](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/35/)

3301. **[One-Line-of-Code Data Mollification Improves Optimization of Likelihood-based Generative Models ↗](https://doi.org/10.52202/075280-0286)**Ba-Hien Tran, Giulio Franzese, Pietro Michiardi A et al.
3302. **[Online (Multinomial) Logistic Bandit: Improved Regret and Constant Computation Cost ↗](https://doi.org/10.52202/075280-1295)**Yu-Jie Zhang, Masashi Sugiyama
3303. **[Online Ad Allocation with Predictions ↗](https://doi.org/10.52202/075280-0756)**Fabian Spaeh, Alina Ene
3304. **[Online Constrained Meta-Learning: Provable Guarantees for Generalization ↗](https://doi.org/10.52202/075280-0683)**Siyuan Xu, Minghui Zhu
3305. **[Online Control for Meta-optimization ↗](https://doi.org/10.52202/075280-1600)**Xinyi Chen, Elad Hazan
3306. **[Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms ↗](https://doi.org/10.52202/075280-2868)**Dheeraj Baby, Saurabh Garg, Tzu-Ching Yen et al.
3307. **[Online Learning under Adversarial Nonlinear Constraints ↗](https://doi.org/10.52202/075280-2316)**Pavel Kolev, Georg Martius, Michael Muehlebach
3308. **[Online PCA in Converging Self-consistent Field Equations ↗](https://doi.org/10.52202/075280-2088)**Xihan Li, Xiang 'Anthony' Chen, Rasul Tutunov et al.
3309. **[Online POMDP Planning with Anytime Deterministic Guarantees ↗](https://doi.org/10.52202/075280-3498)**Moran Barenboim, Vadim Indelman
3310. **[Online Performative Gradient Descent for Learning Nash Equilibria in Decision-Dependent Games ↗](https://doi.org/10.52202/075280-2077)**Zihan Zhu, Ethan Fang, Zhuoran Yang
3311. **[Online Pricing for Multi-User Multi-Item Markets ↗](https://doi.org/10.52202/075280-1294)**Yigit Efe Erginbas, Thomas A. Courtade, Kannan Ramchandran et al.
3312. **[Online RL in Linearly qπ-Realizable MDPs Is as Easy as in Linear MDPs If You Learn What to Ignore ↗](https://doi.org/10.52202/075280-2583)**Gellért Weisz, András György, Csaba Szepesvári
3313. **[Optimal Block-wise Asymmetric Graph Construction for Graph-based Semi-supervised Learning ↗](https://doi.org/10.52202/075280-3115)**Zixing Song, Yifei Zhang, Irwin King
3314. **[Optimal Convergence Rate for Exact Policy Mirror Descent in Discounted Markov Decision Processes ↗](https://doi.org/10.52202/075280-3343)**Emmeran Johnson, Ciara Pike-Burke, Patrick Rebeschini
3315. **[Optimal Excess Risk Bounds for Empirical Risk Minimization on p-Norm Linear Regression ↗](https://doi.org/10.52202/075280-1060)**Ayoub El Hanchi, Murat A. Erdogdu
3316. **[Optimal Extragradient-Based Algorithms for Stochastic Variational Inequalities with Separable Structure ↗](https://doi.org/10.52202/075280-1448)**Angela Yuan, Chris Junchi Li, Gauthier Gidel et al.
3317. **[Optimal Rates for Bandit Nonstochastic Control ↗](https://doi.org/10.52202/075280-0959)**Y. Jennifer Sun, Stephen Newman, Elad Hazan
3318. **[Optimal Transport Model Distributional Robustness ↗](https://doi.org/10.52202/075280-1045)**Van-Anh Nguyen, Thanh-Toan Do, Anh Bui et al.
3319. **[Optimal and Fair Encouragement Policy Evaluation and Learning ↗](https://doi.org/10.52202/075280-0606)**Angela Zhou
3320. **[Optimal cross-learning for contextual bandits with unknown context distributions ↗](https://doi.org/10.52202/075280-2259)**Jon Schneider, Julian Zimmert
3321. **[Optimal privacy guarantees for a relaxed threat model: Addressing sub-optimal adversaries in differentially private machine learning ↗](https://doi.org/10.52202/075280-2435)**Georgios Kaissis, Alexander Ziller, Stefan Kolek et al.
3322. **[Optimality in Mean Estimation: Beyond Worst-Case, Beyond Sub-Gaussian, and Beyond 1+α Moments ↗](https://doi.org/10.52202/075280-0182)**Trung Dang, Jasper Lee, Maoyuan 'Raymond' Song et al.
3323. **[Optimistic Exploration in Reinforcement Learning Using Symbolic Model Estimates ↗](https://doi.org/10.52202/075280-1499)**Sarath Sreedharan, Michael Katz
3324. **[Optimistic Meta-Gradients ↗](https://doi.org/10.52202/075280-2521)**Sebastian Flennerhag, Tom Zahavy, Brendan O’Donoghue et al.
3325. **[Optimistic Rates for Multi-Task Representation Learning ↗](https://doi.org/10.52202/075280-0105)**Austin Watkins, Enayat Ullah, Thanh Nguyen-Tang et al.
3326. **[Optimization and Bayes: A Trade-off for Overparameterized Neural Networks ↗](https://doi.org/10.52202/075280-0594)**Zhengmian Hu, Heng Huang
3327. **[Optimization of Inter-group criteria for clustering with minimum size constraints ↗](https://doi.org/10.52202/075280-0454)**Eduardo Sany Laber, Lucas Murtinho
3328. **[Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Method ↗](https://doi.org/10.52202/075280-0619)**Constantine Caramanis, Dimitris A. Fotakis, Alkis Kalavasis et al.
3329. **[Ordering-based Conditions for Global Convergence of Policy Gradient Methods ↗](https://doi.org/10.52202/075280-1340)**Jincheng Mei, Bo Dai, Alekh Agarwal et al.
3330. **[PUe: Biased Positive-Unlabeled Learning Enhancement by Causal Inference ↗](https://doi.org/10.52202/075280-0869)**Xutao Wang, Hanting Chen, Tianyu Guo et al.
3331. **[PaintSeg: Painting Pixels for Training-free Segmentation ↗](https://doi.org/10.52202/075280-0003)**Xiang Yuan Li, Chung-Ching Lin, Yinpeng Chen et al.
3332. **[Pairwise Causality Guided Transformers for Event Sequences ↗](https://doi.org/10.52202/075280-2018)**Xiao Shou, Debarun Bhattacharjya, Tian Gao et al.
3333. **[Parallel-mentoring for Offline Model-based Optimization ↗](https://doi.org/10.52202/075280-3347)**Can (Sam) Chen, Christopher Beckham, Zixuan Liu et al.
3334. **[Pareto Frontiers in Deep Feature Learning: Data, Compute, Width, and Luck ↗](https://doi.org/10.52202/075280-2082)**Benjamin Edelman, Surbhi Goel, Sham M. Kakade et al.
3335. **[Partial Counterfactual Identification of Continuous Outcomes with a Curvature Sensitivity Model ↗](https://doi.org/10.52202/075280-1390)**Valentyn Melnychuk, Dennis Frauen, Stefan Feuerriegel
3336. **[Partial Matrix Completion ↗](https://doi.org/10.52202/075280-1311)**Elad Hazan, Adam Tauman Kalai, Varun Kanade et al.
3337. **[Participatory Personalization in Classification ↗](https://doi.org/10.52202/075280-0622)**Hailey Joren, Chirag Nagpal, Katherine Heller et al.
3338. **[Path following algorithms for 2-regularized M-estimation with approximation guarantee ↗](https://doi.org/10.52202/075280-0005)**Yunzhang Zhu, Renxiong Liu
3339. **[Payoff-based Learning with Matrix Multiplicative Weights in Quantum Games ↗](https://doi.org/10.52202/075280-1652)**Kyriakos Lotidis, Panayotis Mertikopoulos, Nicholas Bambos et al.
3340. **[Percentile Criterion Optimization in Offline Reinforcement Learning ↗](https://doi.org/10.52202/075280-0409)**Cyrus Cousins, Elita Lobo, Marek Petrik et al.
3341. **[Perceptual adjustment queries and an inverted measurement paradigm for low-rank metric learning ↗](https://doi.org/10.52202/075280-0789)**Austin Xu, Andrew D. McRae, Jingyan Wang et al.
3342. **[Persuading Farsighted Receivers in MDPs: the Power of Honesty ↗](https://doi.org/10.52202/075280-0658)**Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi et al.
3343. **[Pointwise uncertainty quantification for sparse variational Gaussian process regression with a Brownian motion prior ↗](https://doi.org/10.52202/075280-0326)**Luke Travis, Kolyan Ray
3344. **[Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data ↗](https://doi.org/10.52202/075280-2620)**Ruiqi Zhang, Andrea Zanette
3345. **[Policy Optimization in a Noisy Neighborhood: On Return Landscapes in Continuous Control ↗](https://doi.org/10.52202/075280-1335)**Nate Rahn, Pierluca D' Oro, Harley Wiltzer et al.
3346. **[Polyhedron Attention Module: Learning Adaptive-order Interactions ↗](https://doi.org/10.52202/075280-0405)**Tan Zhu, Fei Dou, Xinyu Wang et al.
3347. **[Posterior Sampling for Competitive RL: Function Approximation and Partial Observation ↗](https://doi.org/10.52202/075280-1156)**Shuang Qiu, Ziyu Dai, Han Zhong et al.
3348. **[Practical Contextual Bandits with Feedback Graphs ↗](https://doi.org/10.52202/075280-1334)**Mengxiao Zhang, Yuheng Zhang, Olga Vrousgou et al.
3349. **[Private (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess Risks ↗](https://doi.org/10.52202/075280-2864)**Daogao Liu, Arun Ganesh, Sewoong Oh et al.
3350. **[Private Federated Frequency Estimation: Adapting to the Hardness of the Instance ↗](https://doi.org/10.52202/075280-1258)**Jingfeng Wu, Wennan Zhu, Peter Kairouz et al.
3351. **[Probabilistic Invariant Learning with Randomized Linear Classifiers ↗](https://doi.org/10.52202/075280-3266)**Leonardo Cotta, Gal Yehuda, Assaf Schuster et al.
3352. **[Probabilistic inverse optimal control for non-linear partially observable systems disentangles perceptual uncertainty and behavioral costs ↗](https://doi.org/10.52202/075280-0309)**Dominik Straub, Matthias Schultheis, Heinz Koeppl et al.
3353. **[Projection-Free Online Convex Optimization via Efficient Newton Iterations ↗](https://doi.org/10.52202/075280-0047)**Khashayar Gatmiry, Zakaria Mhammedi
3354. **[ProteinInvBench: Benchmarking Protein Inverse Folding on Diverse Tasks, Models, and Metrics ↗](https://doi.org/10.52202/075280-2983)**Zhangyang Gao, Cheng Tan, Yijie Zhang et al.
3355. **[Provable Adversarial Robustness for Group Equivariant Tasks: Graphs, Point Clouds, Molecules, and More ↗](https://doi.org/10.52202/075280-0012)**Jan Schuchardt, Yan Scholten, Stephan Günnemann
3356. **[Provable Guarantees for Generative Behavior Cloning: Bridging Low-Level Stability and High-Level Behavior ↗](https://doi.org/10.52202/075280-2107)**Adam Block, Ali Jadbabaie, Daniel Pfrommer et al.
3357. **[Provable benefits of score matching ↗](https://doi.org/10.52202/075280-2678)**Chirag Pabbaraju, Dhruv Rohatgi, Anish Prasad Sevekari et al.
3358. **[Provably (More) Sample-Efficient Offline RL with Options ↗](https://doi.org/10.52202/075280-3010)**Xiaoyan Hu, Ho-fung Leung
3359. **[Provably Efficient Offline Reinforcement Learning in Regular Decision Processes ↗](https://doi.org/10.52202/075280-1711)**Roberto Cipollone, Anders Jonsson, Alessandro Ronca et al.
3360. **[QuadAttacK: A Quadratic Programming Approach to Learning Ordered Top-K Adversarial Attacks ↗](https://doi.org/10.52202/075280-2127)**Thomas Paniagua, Ryan Grainger, Tianfu Wu
3361. **[Quasi-Monte Carlo Graph Random Features ↗](https://doi.org/10.52202/075280-0651)**Isaac Reid, Krzysztof Choromański, Adrian Weller
3362. **[R-divergence for Estimating Model-oriented Distribution Discrepancy ↗](https://doi.org/10.52202/075280-2474)**Zhilin Zhao, Longbing Cao
3363. **[RL-based Stateful Neural Adaptive Sampling and Denoising for Real-Time Path Tracing ↗](https://doi.org/10.52202/075280-2898)**Antoine Scardigli, Lukas Cavigelli, Lorenz K. Müller
3364. **[RaLEs: a Benchmark for Radiology Language Evaluations ↗](https://doi.org/10.52202/075280-3254)**Juanma Zambrano Chaves, Nandita Bhaskhar, Maayane Attias et al.
3365. **[ReHLine: Regularized Composite ReLU-ReHU Loss Minimization with Linear Computation and Linear Convergence ↗](https://doi.org/10.52202/075280-0631)**Ben Dai, Yixuan Qiu
3366. **[Reconciling Competing Sampling Strategies of Network Embedding ↗](https://doi.org/10.52202/075280-0300)**Yuchen Yan, Baoyu Jing, Lihui Liu et al.
3367. **[Recursion in Recursion: Two-Level Nested Recursion for Length Generalization with Scalability ↗](https://doi.org/10.52202/075280-3038)**Jishnu Ray Chowdhury, Cornelia Caragea
3368. **[Refined Mechanism Design for Approximately Structured Priors via Active Regression ↗](https://doi.org/10.52202/075280-1095)**Christos Boutsikas, Petros Drineas B, Marios Mertzanidis et al.
3369. **[RegBN: Batch Normalization of Multimodal Data with Regularization ↗](https://doi.org/10.52202/075280-0949)**Morteza Ghahremani, Christian Wachinger
3370. **[Regression with Cost-based Rejection ↗](https://doi.org/10.52202/075280-1958)**Xin Cheng, Yuzhou Cao, Haobo Wang et al.
3371. **[Regret Minimization via Saddle Point Optimization ↗](https://doi.org/10.52202/075280-1531)**Johannes Kirschner, Alireza Bakhtiari, Kushagra Chandak et al.
3372. **[Regularized Behavior Cloning for Blocking the Leakage of Past Action Information ↗](https://doi.org/10.52202/075280-0102)**Seokin Seo, HyeongJoo Hwang, Hongseok Yang et al.
3373. **[Rehearsal Learning for Avoiding Undesired Future ↗](https://doi.org/10.52202/075280-3529)**Tian Qin, Tian-Zuo Wang, Zhi-Hua Zhou
3374. **[Reinforcement Learning with Fast and Forgetful Memory ↗](https://doi.org/10.52202/075280-3150)**Steven Morad, Ryan Kortvelesy, Stephan Liwicki et al.
3375. **[Reliable learning in challenging environments ↗](https://doi.org/10.52202/075280-2083)**Maria-Florina Balcan, Steve Hanneke, Rattana Pukdee et al.
3376. **[Renku: a platform for sustainable data science ↗](https://doi.org/10.52202/075280-1827)**Rok Roškar, Chandrasekhar Ramakrishnan, Michele Volpi et al.
3377. **[Representation Learning via Consistent Assignment of Views over Random Partitions ↗](https://doi.org/10.52202/075280-1720)**Thalles Santos Silva, Adıń Ramıŕez Rivera
3378. **[ResoNet: Noise-Trained Physics-Informed MRI Off-Resonance Correction ↗](https://doi.org/10.52202/075280-0624)**Alfredo De Goyeneche, Shreya Ramachandran, Ke Wang et al.
3379. **[Resolving the Tug-of-War: A Separation of Communication and Learning in Federated Learning ↗](https://doi.org/10.52202/075280-0153)**Junyi Li, Heng Huang
3380. **[Retaining Beneficial Information from Detrimental Data for Neural Network Repair ↗](https://doi.org/10.52202/075280-2084)**Junzhou Huang, Peilin Zhao, Junzhou Huang et al.
3381. **[Rethinking Gauss-Newton for learning over-parameterized models ↗](https://doi.org/10.52202/075280-1451)**Michael Arbel, Romain Menegaux, Pierre Wolinski
3382. **[Revisiting Area Convexity: Faster Box-Simplex Games and Spectrahedral Generalizations ↗](https://doi.org/10.52202/075280-2512)**Arun Jambulapati, Kevin Tian
3383. **[Reward Scale Robustness for Proximal Policy Optimization via DreamerV3 Tricks ↗](https://doi.org/10.52202/075280-0067)**Ryan J. Sullivan, Akarsh Kumar, Shengyi Huang et al.
3384. **[Riemannian Laplace approximations for Bayesian neural networks ↗](https://doi.org/10.52202/075280-1354)**Federico Bergamin, Pablo Moreno-Muñoz, Søren Hauberg et al.
3385. **[Riemannian SAM: Sharpness-Aware Minimization on Riemannian Manifolds ↗](https://doi.org/10.52202/075280-2871)**Jihun Yun, Eunho Yang
3386. **[Robust Concept Erasure via Kernelized Rate-Distortion Maximization ↗](https://doi.org/10.52202/075280-1875)**Somnath Basu Roy Chowdhury, Nicholas Monath, Kumar Avinava Dubey et al.
3387. **[Robust Knowledge Transfer in Tiered Reinforcement Learning ↗](https://doi.org/10.52202/075280-2268)**Jiawei Huang, Niao He
3388. **[Robust Model Reasoning and Fitting via Dual Sparsity Pursuit ↗](https://doi.org/10.52202/075280-3126)**Xingyu Jiang, Jiayi Ma
3389. **[Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing ↗](https://doi.org/10.52202/075280-2369)**Shuyao Li, Yu Cheng, Ilias Diakonikolas et al.
3390. **[Robust and Actively Secure Serverless Collaborative Learning ↗](https://doi.org/10.52202/075280-1716)**Nicholas Franzese, Adam Dziedzic, Christopher A. Choquette-Choo et al.
3391. **[Robustness Guarantees for Adversarially Trained Neural Networks ↗](https://doi.org/10.52202/075280-1725)**Poorya Mianjy, Raman Arora
3392. **[SALSA VERDE: a machine learning attack on LWE with sparse small secrets ↗](https://doi.org/10.52202/075280-2322)**Cathy Li, Emily Wenger, Zeyuan Allen-Zhu et al.
3393. **[SG×P : A Sorghum Genotype × Phenotype Prediction Dataset and Benchmark ↗](https://doi.org/10.52202/075280-0785)**Zeyu Zhang, Robert Pless, Nadia Shakoor et al.
3394. **[SHOT: Suppressing the Hessian along the Optimization Trajectory for Gradient-Based Meta-Learning ↗](https://doi.org/10.52202/075280-2685)**Junhoo Lee, Jayeon Yoo, Nojun Kwak
3395. **[SOL: Sampling-based Optimal Linear bounding of arbitrary scalar functions ↗](https://doi.org/10.52202/075280-1439)**Yuriy Biktairov, Jyotirmoy V. Deshmukh
3396. **[SPQR: Controlling Q-ensemble Independence with Spiked Random Model for Reinforcement Learning ↗](https://doi.org/10.52202/075280-2846)**Dohyeok Lee, Seungyub Han, Taehyun Cho et al.
3397. **[SPRING: Studying Papers and Reasoning to play Games ↗](https://doi.org/10.52202/075280-0983)**Yue Wu, So Yeon Min, Shrimai Prabhumoye et al.
3398. **[SQ Lower Bounds for Learning Mixtures of Linear Classifiers ↗](https://doi.org/10.52202/075280-1188)**Ilias Diakonikolas, Daniel M. Kane, Yuxin Sun
3399. **[SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions ↗](https://doi.org/10.52202/075280-0184)**Ilias Diakonikolas, Daniel M. Kane, Lisheng Ren et al.
3400. **[SUBP: Soft Uniform Block Pruning for 1×N Sparse CNNs Multithreading Acceleration ↗](https://doi.org/10.52202/075280-2266)**Jingyang Xiang, Siqi Li, Jun Chen et al.

[← prev](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/33/) [1](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/) … [30](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/30/) … [33](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/33/) **34** [35](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/35/) [36](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/36/) [next →](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/papers/page/35/)

- [← back to](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2023/) — NeurIPS 2023