Fault Tolerant Coresets
arXiv:2611.17574v1 Announce Type: new Abstract: Coresets are small weighted summaries of large datasets that help quickly evaluate some loss objectives on the input dataset. We mainly focus on coresets for the $k$-means…
Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
40 articles · 3 sources · 40 papers ·
Top topics: Algorithms · AI
arXiv:2611.17574v1 Announce Type: new Abstract: Coresets are small weighted summaries of large datasets that help quickly evaluate some loss objectives on the input dataset. We mainly focus on coresets for the $k$-means…
arXiv:2605.30564v2 Announce Type: replace-cross Abstract: A classic result of Alon, Yuster, and Zwick (AYZ, Algorithmica 1997) shows that all $2k$-cycles in an $m$-edge graph can be listed in $\tilde O(m^{2-1/k}+t)$…
arXiv:2409.12566v4 Announce Type: replace-cross Abstract: We study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel $\mathcal N: \mathbb C^{d_{\mathrm{in}}…
arXiv:2611.18399v1 Announce Type: new Abstract: In the context of finding thin trees, like laminarly-thin trees or globally-thin trees, it turned out to be challenging to round a fractional solution to an integral one…
arXiv:2406.01999v3 Announce Type: replace Abstract: In machine learning and signal processing, methods based on (abstract) cell complexes (CCs) are being applied successfully in different applications. However, there is…
arXiv:2611.17502v1 Announce Type: new Abstract: Maximum-product bipartite matching supports scaling and static pivot selection in sparse matrix preprocessing. We present Dual-Slack Frontier Matching (DSFM), a…
arXiv:2611.17541v1 Announce Type: new Abstract: We consider the problem of 2 dimensional pattern matching under Quantum Query model. Here, we are given a rectangular text $T[0..n_1-1][0..n_2-1]$ and a pattern $P[0..m_1…
arXiv:2607.23863v2 Announce Type: replace Abstract: We give a $\text{poly}(d, p, \log(1/\epsilon))$-time algorithm that computes an $\epsilon$-approximate fixed point of any $\ell_p$-nonexpansive map $f : \mathcal{X}…
arXiv:2611.17951v1 Announce Type: new Abstract: Min-UnCoverage asks for at most $k$ sets minimizing uncovered weight. Min-Unsat SAT and Min-Unsat CSP ask for an assignment with at most $k$ true variables minimizing the…
arXiv:2211.03997v4 Announce Type: replace-cross Abstract: We study online decision making with possibly nonconvex (for example, combinatorial or integer) local feasible sets and convex long-term constraints. At each…
arXiv:2611.18028v1 Announce Type: new Abstract: Long integer multiplication is a fundamental operation in computational algebra, heavily relying on Toom--Cook and related evaluation-interpolation algorithms.…
arXiv:2611.18544v1 Announce Type: new Abstract: The popular $k$-means++ algorithm, or $D^\ell$-sampling, is a fundamental primitive in both the theory and practice of clustering. In the bi-criteria setting, the…
arXiv:2611.18369v1 Announce Type: new Abstract: For which sets F of edge modifications do a graph G and the modified graph share a maximum cardinality search (MCS) ordering? We prove that they do whenever, along every…
arXiv:2611.18262v1 Announce Type: new Abstract: Facility location with outliers asks which facilities to open and which clients to serve, subject to a prescribed service quota. We give a framework for transferring…
arXiv:2611.18152v1 Announce Type: new Abstract: Segment routing is a modern variant of source routing which has recently become popular in the Internet. It allows operators to equip network packets with an additional…
arXiv:2611.18391v1 Announce Type: cross Abstract: Color refinement, also known as the $1$-dimensional Weisfeiler-Leman algorithm ($1$-WL), is a classical near-linear-time heuristic for graph isomorphism, which also…
arXiv:2602.11454v4 Announce Type: replace Abstract: We study $\left(\epsilon,\delta\right)$-differentially private algorithms for the problem of approximately computing the top singular vector of a matrix…
arXiv:2611.18545v1 Announce Type: new Abstract: Smoothed analysis has become a central tool in theoretical computer science, often allowing for significant improvements to worst-case running times if we settle for a…
arXiv:2607.01159v2 Announce Type: replace-cross Abstract: We study the online fair division of indivisible mixed manna among agents with additive valuation functions. Under the standard online model, at each time step…
arXiv:2611.17845v1 Announce Type: new Abstract: We determine the dense worst-case quantum query complexity of exact minimum multicut on simple unweighted undirected graphs. With at most $k$ explicit demand pairs, our…
Showing 1 day · 40 items available