cs.DS · 2026-09-15 · No. 114
Data Structures and Algorithms, 2026-09-15.
2 new papers in cs.DS. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
2 entries-
01
Thin-shell stability of Gaussian cooling: logconcave sampling with sesteric complexity from a cold start
Yunbum Kook, Santosh S. Vempala
cs.DS · cs.LG · math.PR
We show that logconcave probability measures along the Gaussian cooling path have thin-shell stability, generalizing the thin-shell theorem. This result leads to improved complexity for the fundamental problem of sampling an arbitrary logconcave distribution from a cold start. For (near-)isotropic logconcave distributions, the complexity is nearly $n^{2.5}$, improving the previous bound of $n^{2.75}$, and matching the complexity of the...
-
02
Strong and Compact Policies for Submodular Markov Decision Processes via LP-Based Submodular Orienteering
Lars Rohwedder, Rico Zenklusen
cs.DS · cs.LG
Finding policies for Markov Decision Processes (MDPs) is a central problem in areas such as Reinforcement Learning and Operations Research. Here, we have to repeatedly choose an action that should be performed by an agent. Depending on the action and the current state of the agent, the agent collects a reward and randomly transitions into a new state. The goal is to maximize the reward in expectation over a finite time horizon of length $H$....
This edition is part of The Daily Abstract — cs.DS archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.