1 citations · 1 across the 5 of their papers we have counts for
5 papers
Performance Guarantees for Data-Driven Sequential Decision-Making
Bowen Li, Edwin K. P. Chong, Ali Pezeshki
The solutions to many sequential decision-making problems are characterized by dynamic programming and Bellman's principle of optimality. However, due to the inherent complexity of…
A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
Brandon Van Over, Bowen Li, Edwin K. P. Chong +1
We present a simple performance bound for the greedy scheme in string optimization problems that obtains strong results. Our approach vastly generalizes the group of previously est…
On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
Bowen Li, Brandon Van Over, Edwin K. P. Chong +1
We consider the celebrated bound introduced by Conforti and Cornuéjols (1984) for greedy schemes in submodular optimization. The bound assumes a submodular function defined on a co…
An Improved Greedy Curvature Bound in Finite-Horizon String Optimization with Application to a Sensor Coverage Problem
Brandon Van Over, Bowen Li, Edwin K. P. Chong +1
We study the optimization problem of choosing strings of finite length to maximize string submodular functions on string matroids, which is a broader class of problems than maximiz…
Minimax Concave Penalty Regularized Adaptive System Identification
Bowen Li, Suya Wu, Erin E. Tripp +2
We develop a recursive least square (RLS) type algorithm with a minimax concave penalty (MCP) for adaptive identification of a sparse tap-weight vector that represents a communicat…