Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Lee, Duksang"'
Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism
This paper studies the safe reinforcement learning problem formulated as an episodic finite-horizon tabular constrained Markov decision process with an unknown transition kernel and stochastic reward and cost functions. We propose a model-based algor
Externí odkaz:
http://arxiv.org/abs/2410.10158
This paper studies a long-term resource allocation problem over multiple periods where each period requires a multi-stage decision-making process. We formulate the problem as an online allocation problem in an episodic finite-horizon constrained Mark
Externí odkaz:
http://arxiv.org/abs/2305.10744
This paper develops projection-free algorithms for online convex optimization with stochastic constraints. We design an online primal-dual projection-free framework that can take any projection-free algorithms developed for online convex optimization
Externí odkaz:
http://arxiv.org/abs/2305.01333
We study the problem of maximizing a continuous DR-submodular function that is not necessarily smooth. We prove that the continuous greedy algorithm achieves an $[(1-1/e)\OPT-\epsilon]$ guarantee when the function is monotone and H\"older-smooth, mea
Externí odkaz:
http://arxiv.org/abs/2210.06061
Autor:
Lee, Duksang, Oum, Sang-il
Publikováno v:
European J. Combin., 113:103761, October 2023
Tutte (1961) proved the chain theorem for simple $3$-connected graphs with respect to minors, which states that every simple $3$-connected graph $G$ has a simple $3$-connected minor with one edge fewer than $G$, unless $G$ is a wheel graph. Bouchet (
Externí odkaz:
http://arxiv.org/abs/2110.10390
Autor:
Lee, Duksang, Oum, Sang-il
Publikováno v:
SIAM J. Discrete Math., 37(1):304-314, March 2023
We show that for pairs $(Q,R)$ and $(S,T)$ of disjoint subsets of vertices of a graph $G$, if $G$ is sufficiently large, then there exists a vertex $v$ in $V(G)-(Q\cup R\cup S\cup T)$ such that there are two ways to reduce $G$ by a vertex-minor opera
Externí odkaz:
http://arxiv.org/abs/2106.03414
Publikováno v:
Combinatorica, 43(5):963-983, October 2023
For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose vertices are labelled by elements of $\Gamma$. We prove that a certain collection of edge sets of a $\Gamma$-labelled graph forms a delta-matroid, which we call a $\Gamma$-grap
Externí odkaz:
http://arxiv.org/abs/2104.11383
Autor:
Lee, Duksang, Oum, Sang-il
Publikováno v:
European J. Combin., 101(Article 103476), March 2022
We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass of the class of regular matroids. We
Externí odkaz:
http://arxiv.org/abs/2007.13298
Autor:
Lee, Duksang, Oum, Sang-il
Publikováno v:
In European Journal of Combinatorics October 2023 113
Autor:
Lee, Duksang, Oum, Sang-il
Publikováno v:
In European Journal of Combinatorics March 2022 101