research
∙
12/28/2022
Optimal algorithms for group distributionally robust optimization and beyond
Distributionally robust optimization (DRO) can improve the robustness an...
share
research
∙
07/17/2022
Shrunk subspaces via operator Sinkhorn iteration
A recent breakthrough in Edmonds' problem showed that the noncommutative...
research
∙
07/16/2022
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
Matrix representations are a powerful tool for designing efficient algor...
research
∙
05/20/2021
Online Risk-Averse Submodular Maximization
We present a polynomial-time online algorithm for maximizing the conditi...
research
∙
04/30/2020
Information geometry of operator scaling
Matrix scaling is a classical problem with a wide range of applications....
research
∙
02/14/2020
Statistical Learning with Conditional Value at Risk
We propose a risk-averse statistical learning framework wherein the perf...
research
∙
09/07/2018
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
In dictionary selection, several atoms are selected from finite candidat...
research
∙
07/13/2018
Spectral Sparsification of Hypergraphs
For an undirected/directed hypergraph G=(V,E), its Laplacian L_GR^V→R^V ...
research
∙
07/13/2018
No-regret algorithms for online k-submodular maximization
We present a polynomial time algorithm for online maximization of k-subm...
research
∙
06/19/2018
Maximally Invariant Data Perturbation as Explanation
While several feature scoring methods are proposed to explain the output...
research
∙
03/29/2018
Polynomial-Time Algorithms for Submodular Laplacian Systems
Let G=(V,E) be an undirected graph, L_G∈R^V × V be the associated Laplac...
research
∙
07/09/2017
