Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
56 articles · 3 sources · 56 papers ·
Top topics: Algorithms · AI
arXiv:2610.08735v1 Announce Type: cross Abstract: In online inverse linear optimization, a learner recommends an action and then observes the choice of an expert who maximizes a fixed, unknown linear objective on…
arXiv:2408.02403v2 Announce Type: replace-cross Abstract: We investigate the online fair allocation problem with sequentially arriving items under various input models, with the goal of balancing fairness and…
arXiv:2510.15593v3 Announce Type: replace Abstract: Network redesign problems ask for modifications to the edges of a given graph to satisfy certain properties. In temporal graphs, where edges are only active at certain…
arXiv:2604.08408v2 Announce Type: replace-cross Abstract: Preparing Gibbs states on a quantum computer offers a way to computationally probe how microscopic interactions give rise to macroscopic phenomena at finite…
arXiv:2510.09589v2 Announce Type: replace Abstract: We consider the problem of minimizing the weighted makespan on a single machine with restarts. Restarts are similar to preemptions but weaker: a job can be…
arXiv:2610.07055v1 Announce Type: cross Abstract: We study the query complexity of finding a Tarski fixed point over $[n]^k$. Previous work has left a large gap between $\smash{{\Omega}(\log^2 n)}$ and…
arXiv:2610.07114v1 Announce Type: cross Abstract: The Fr\'echet Inception Distance (FID) is widely used to evaluate generative models, but its empirical plug-in estimator suffers from finite-sample bias [BSAG18, CF20].…
arXiv:2610.07465v1 Announce Type: new Abstract: We give an exact algorithm for continuous separable convex quadratic programming with an integer equality matrix and nonnegative variables. The number of rational…
arXiv:2610.08504v1 Announce Type: new Abstract: We construct explicit n x n x n tensors of border rank at least 3n-o(n), improving the previous record of (2 + $\varepsilon$)n due to (Landsberg and Michalek 2025). We…
arXiv:2602.19649v2 Announce Type: replace Abstract: In this paper, we study the sensitivity of the Lempel--Ziv 77 (LZ77) algorithm under multiple substitutions. Akagi, Funakoshi and Inenaga [JIC, 2023] showed that when…
arXiv:2610.08134v1 Announce Type: new Abstract: We design an almost instance optimal algorithm for the sum estimation problem using weighted sampling. We show that the sample complexity for sum estimation is closely…
arXiv:2610.07690v1 Announce Type: new Abstract: Given a complete graph whose edge weights represent dissimilarities, Metric Violation Distance asks whether at most $k$ weights can be changed to form a metric. Motivated…
arXiv:2607.28574v3 Announce Type: replace Abstract: In perpetual scheduling theory, the Pinwheel Covering problem asks, given $n$ frequencies $f_i$, whether there exists an infinite schedule such that every $f_i$…
arXiv:2610.07285v1 Announce Type: new Abstract: We study an online trading problem where a trader, given a sequence of i.i.d. prices drawn from a known distribution $F$ on $[0,1]$, must make irrevocable buy, sell, or…
arXiv:2606.10944v2 Announce Type: replace-cross Abstract: We introduce a new tool, Express, for converting a non-causal attention approximation into a causal approximation with matching approximation guarantees. When…
arXiv:2610.07387v1 Announce Type: new Abstract: Maximizing a submodular function subject to a matroid constraint is a cornerstone problem in combinatorial optimization. The state-of-the-art algorithm for this problem…
arXiv:2610.08466v1 Announce Type: new Abstract: The maximum-entropy sampling problem (MESP) seeks, for an order-$n$ covariance matrix $C$, a principal submatrix of order $s$ with maximum log-determinant. Mostly for…
arXiv:2610.08645v1 Announce Type: new Abstract: When optimizing computing architecture for specific computationally intensive tasks, such as evaluating or training a neural network, it is important to identify what…
arXiv:2609.40277v2 Announce Type: replace-cross Abstract: We present an efficient quantum algorithm for the non-uniform Chebyshev transform. It is defined as the projection of a function onto Chebyshev polynomials…
arXiv:2610.08701v1 Announce Type: cross Abstract: We prove that the probability that Gaussian elimination with partial pivoting on $n \times n$ random matrices has growth $\rho$ is at least inverse quasi-polynomial:…
Showing 1 day · 56 items available
