Poster "function approximation" Papers

15 papers found

Filters:posterfunction approximationClear all

Conference

AAAI 2025 (3,028)COLM 2025 (418)CVPR 2025 (2,873)ICCV 2025 (2,701)ICLR 2025 (3,827)ICML 2025 (3,340)ISMAR 2025 (229)NEURIPS 2025 (5,858)AAAI 2024 (2,289)CVPR 2024 (2,716)ECCV 2024 (2,387)ICLR 2024 (2,297)ICML 2024 (2,635)

Paper Type

poster (24,624)paper (8,558)oral (1,594)spotlight (1,421)highlight (975)

Adversarial Policy Optimization for Offline Preference-based Reinforcement Learning

Hyungkyu Kang, Min-hwan Oh

ICLR 2025arXiv:2503.05306
3
citations

Attention Mechanism, Max-Affine Partition, and Universal Approximation

Hude Liu, Jerry Yao-Chieh Hu, Zhao Song et al.

NEURIPS 2025arXiv:2504.19901
6
citations

Finite-Time Bounds for Average-Reward Fitted Q-Iteration

Jongmin Lee, Ernest Ryu

NEURIPS 2025arXiv:2510.17391

From Kolmogorov to Cauchy: Shallow XNet Surpasses KANs

Xin Li, Xiaotao Zheng, Zhihong Xia

NEURIPS 2025

Learning a Fast Mixing Exogenous Block MDP using a Single Trajectory

Alexander Levine, Peter Stone, Amy Zhang

ICLR 2025arXiv:2410.03016
1
citations

Regret Analysis of Average-Reward Unichain MDPs via an Actor-Critic Approach

Swetha Ganesh, Vaneet Aggarwal

NEURIPS 2025arXiv:2505.19986
3
citations

Second Order Bounds for Contextual Bandits with Function Approximation

Aldo Pacchiano

ICLR 2025arXiv:2409.16197
7
citations

Stochastic Semi-Gradient Descent for Learning Mean Field Games with Population-Aware Function Approximation

Chenyu Zhang, Xu Chen, Xuan Di

ICLR 2025arXiv:2408.08192
7
citations

Vocabulary In-Context Learning in Transformers: Benefits of Positional Encoding

Qian Ma, Ruoxiang Xu, Yongqiang Cai

NEURIPS 2025arXiv:2511.06376

ACPO: A Policy Optimization Algorithm for Average MDPs with Constraints

Akhil Agnihotri, Rahul Jain, Haipeng Luo

ICML 2024arXiv:2302.00808
2
citations

Characterizing ResNet's Universal Approximation Capability

Chenghao Liu, Enming Liang, Minghua Chen

ICML 2024

Imitation Learning in Discounted Linear MDPs without exploration assumptions

Luca Viano, EFSTRATIOS PANTELEIMON SKOULAKIS, Volkan Cevher

ICML 2024arXiv:2405.02181
8
citations

Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RL

Jiawei Huang, Niao He, Andreas Krause

ICML 2024arXiv:2402.05724
8
citations

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback

Asaf Cassel, Haipeng Luo, Aviv Rosenberg et al.

ICML 2024arXiv:2405.07637
5
citations

On The Statistical Complexity of Offline Decision-Making

Thanh Nguyen-Tang, Raman Arora

ICML 2024arXiv:2501.06339
2
citations