相关论文: Metric Extension Operators, Vertex Sparsifiers and…

Given a large graph $G$ with a subset $|T|=k$ of its vertices called terminals, a quality-$q$ flow sparsifier is a small graph $G'$ that contains $T$ and preserves all multicommodity flows that can be routed between terminals in $T$, to…

Consider a bounded open set $U$ in $R^n$ and a Lipschitz function g from the boundary of $U$ to $R^m$. Does this function always have a canonical optimal Lipschitz extension to all of $U$? We propose a notion of optimal Lipschitz extension…

We study a family of sparse estimators defined as minimizers of some empirical Lipschitz loss function -- which include the hinge loss, the logistic loss and the quantile regression loss -- with a convex, sparse or group-sparse…

We give an almost-linear time algorithm for the Steiner connectivity augmentation problem: given an undirected graph, find a smallest (or minimum weight) set of edges whose addition makes a given set of terminals $\tau$-connected (for any…

We consider a variation of the spectral sparsification problem where we are required to keep a subgraph of the original graph. Formally, given a union of two weighted graphs $G$ and $W$ and an integer $k$, we are asked to find a $k$-edge…

We propose a variable metric extension of the forward--backward-forward algorithm for finding a zero of the sum of a maximally monotone operator and a Lipschitzian monotone operator in Hilbert spaces. In turn, this framework provides a…

We introduce the $st$-cut version the Sparsest-Cut problem, where the goal is to find a cut of minimum sparsity among those separating two distinguished vertices $s,t\in V$. Clearly, this problem is at least as hard as the usual (non-$st$)…

Operator learning based on neural operators has emerged as a promising paradigm for the data-driven approximation of operators, mapping between infinite-dimensional Banach spaces. Despite significant empirical progress, our theoretical…

We initiate the study of dynamic algorithms for graph sparsification problems and obtain fully dynamic algorithms, allowing both edge insertions and edge deletions, that take polylogarithmic time after each update in the graph. Our three…

In 1990, Alon, Seymour, and Thomas gave the first balanced separator of size $O(h^{3/2}\sqrt{n})$ for any $K_h$-minor-free graph, which has had numerous algorithmic applications. They conjectured that the size of the balanced separator can…

Vertex connectivity a classic extensively-studied problem. Given an integer $k$, its goal is to decide if an $n$-node $m$-edge graph can be disconnected by removing $k$ vertices. Although a linear-time algorithm was postulated since 1974…

This paper addresses the problem of learning to sparsify stochastic linear bandits, where a decision-maker sequentially selects actions from a high-dimensional space subject to a sparsity constraint on the number of nonzero elements in the…

Zhang et al. introduced a novel modification of Goldstein's classical subgradient method, with an efficiency guarantee of $O(\varepsilon^{-4})$ for minimizing Lipschitz functions. Their work, however, makes use of a nonstandard subgradient…

Let $\Omega\subset\dR^d$ be a bounded or an unbounded Lipschitz domain. In this note we address the problem of continuation of functions from the Sobolev space $H^1(\Omega)$ up to functions in the Sobolev space $H^1(\dR^d)$ via a linear…

We provide an example of a zero-dimensional compact metric space $X$ and its closed subspace $A$ such that there is no continuous linear extension operator for the Lipschitz pseudometrics on $A$ to the Lipschitz pseudometrics on $X$. The…

We study the best-arm identification problem in sparse linear bandits under the fixed-budget setting. In sparse linear bandits, the unknown feature vector $\theta^*$ may be of large dimension $d$, but only a few, say $s \ll d$ of these…

We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of…

We give an algorithm for augmenting the edge connectivity of an undirected graph by using the isolating cuts framework (Li and Panigrahi, FOCS '20). Our algorithm uses poly-logarithmic calls to any max-flow algorithm, which yields a running…

Given a bounded Lipschitz domain $\Omega\subset\mathbb R^n$, Rychkov showed that there is a linear extension operator $\mathcal E$ for $\Omega$ which is bounded in Besov and Triebel-Lizorkin spaces. In this paper we introduce some new…

The family of $(k, \ell)$-sparse graphs, introduced by Lorea, plays a central role in combinatorial optimization and has a wide range of applications, particularly in rigidity theory. A key algorithmic challenge is to compute a…