Cover Image

Fitting Reinforcement Learning Model to Behavioral Data under Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhu, Hao, Hoffmann, Jasper, Zhang, Baohe, Boedecker, Joschka
Format:	Preprint
Published:	2025
Subjects:	Computational Engineering, Finance, and Science Machine Learning Optimization and Control Neurons and Cognition 90C25, 90C59, 90C90
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multi-convex Programming for Discrete Latent Factor Models Prototyping
by: Zhu, Hao, et al.
Published: (2025)

Disciplined Biconvex Programming
by: Zhu, Hao, et al.
Published: (2025)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
by: Dörfler, Daniel, et al.
Published: (2020)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
by: Im, Haesol, et al.
Published: (2024)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
by: Dörfler, Daniel, et al.
Published: (2026)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
by: Halbig, Katrin, et al.
Published: (2024)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)

Tractable downfall of basis pursuit in structured sparse optimization
by: Marmary, Maya V., et al.
Published: (2025)

MOCVXPY: a CVXPY extension for multiobjective optimization
by: Salomon, Ludovic, et al.
Published: (2025)

Perpertual Coupled Simulated Annealing for Continuous Optimization
by: Gonçalves-e-Silva, Kayo, et al.
Published: (2018)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
by: Qu, Zheng, et al.
Published: (2023)

A Canceling Heuristic for the Directed Traveling Salesman Problem
by: Borgwardt, Steffen, et al.
Published: (2026)

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
by: Badenbroek, Riley, et al.
Published: (2024)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

Structural and Solution Analysis for the Ordered Weber Problem under Spatial Uncertainty
by: Blanco, Víctor, et al.
Published: (2025)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023)

Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data
by: Harris, Elizabeth, et al.
Published: (2024)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

Metaheuristic algorithms for the induced P-median problem with upgrades
by: Salazar, Sergio, et al.
Published: (2026)

An ODE approach to multiple choice polynomial programming
by: Shao, Sihong, et al.
Published: (2022)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
by: Bolusani, Suresh, et al.
Published: (2024)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization
by: Thomä, Simon, et al.
Published: (2024)

Simulation-Optimization Approaches for the Network Immunization Problem with Quarantining
by: Hoogervorst, Rowan, et al.
Published: (2024)

Applying a Random-Key Optimizer on Mixed Integer Programs
by: Chaves, Antonio A., et al.
Published: (2026)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
by: Kim, Junyoung, et al.
Published: (2024)

Designing Tractable Piecewise Affine Policies for Multi-Stage Adjustable Robust Optimization
by: Thomä, Simon, et al.
Published: (2022)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
by: García-Castaño, Fernando, et al.
Published: (2024)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
by: García-Castaño, Fernando, et al.
Published: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
by: Arima, Naohiko, et al.
Published: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
by: Fersztand, David, et al.
Published: (2024)

Separable QCQPs and Their Exact SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2025)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
by: Rothschild, Jacob H.
Published: (2024)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
by: Nguyen, Vinh
Published: (2025)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)