Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
38 articles · 3 sources · 38 papers ·
Top topics: Algorithms · AI
arXiv:2604.14501v2 Announce Type: replace-cross Abstract: We study how depth, finite precision, state dimension, and chain-of-thought (CoT) affect the expressive power of multi-layer state-space models (SSMs). For the…
arXiv:2609.01759v1 Announce Type: new Abstract: Classical lower bounds for $\mathrm{AC^0}$ circuits proceed bottom-up by simplifying or approximating gates beginning at the input layer. We introduce a complementary…
arXiv:2609.02145v1 Announce Type: cross Abstract: We study online maximization of nonnegative, non-monotone DR-submodular functions over compact convex down-closed subsets of the $d$-dimensional unit cube. The best…
arXiv:2609.02880v1 Announce Type: cross Abstract: We study the question of answering linear queries with differential privacy using few (expected) random bits. We provide a randomness-efficient analog of the $\| \cdot…
arXiv:2409.20182v4 Announce Type: replace-cross Abstract: Fully homomorphic encryption (FHE) enables privacy-preserving cloud computation, but its efficiency is often limited by the cost of bootstrapping. In particular,…
arXiv:2407.00966v3 Announce Type: replace-cross Abstract: In traditional models of supervised learning, the goal of a learner-- given examples from an arbitrary joint distribution on $\mathbb{R}^d \times \{\pm 1\}$-- is…
arXiv:2407.07310v3 Announce Type: replace-cross Abstract: Factored Markov Decision Processes (fMDPs) are a class of Markov Decision Processes (MDPs) in which the states (and actions) can be factored into a set of state…
arXiv:2609.02585v1 Announce Type: cross Abstract: Although almost all graphs are asymmetric -- having no nontrivial global automorphisms -- they may still possess local symmetries in the form of isomorphisms between…
arXiv:2609.01998v1 Announce Type: cross Abstract: We present a new upper bound on the defect of the Mondrian Art Problem. The Mondrian Art Problem asks for a partition of an $n \times n$ square with rectangles of…
arXiv:2606.19573v2 Announce Type: replace-cross Abstract: We reduce the embracing exchange distance of bases of oriented matroids to the metric of oriented matroid polyhedra. This allows us to disprove recent…
arXiv:2609.02804v1 Announce Type: new Abstract: For more than 20 years, the Model-RB benchmark frb100-40 remained an open challenge; since 2014, its public record had stood at 99 of 100 variables. We give a directly…
arXiv:2609.02317v1 Announce Type: cross Abstract: The cycle space of a directed graph is generated by a cycle basis, where, in general, cycles are allowed to have both forward and backward arcs. In a forward cycle, all…
arXiv:2510.21549v3 Announce Type: replace-cross Abstract: The distributed coloring problem is arguably one of the key problems studied in the area of distributed graph algorithms. The most standard variant of the…
arXiv:2609.02180v1 Announce Type: cross Abstract: Let $0 < \alpha \leq 1/2$. We say that a finite point set $P$ in $\mathbb{R}^d$ is $\alpha$-split by a hyperplane $h$ if each of the closed half-spaces determined by…
arXiv:2507.11686v2 Announce Type: replace-cross Abstract: For a graph $G = (V,E)$ and a subset $R \subseteq V$, we say that $R$ is \textit{multiset resolving} for $G$ if for every pair of vertices $v,w$, the…
arXiv:2609.02389v1 Announce Type: cross Abstract: An edge card of a graph is obtained by deleting one edge, and a class edge-reconstruction number asks for the fewest carefully selected cards that identify the graph…
arXiv:2609.02234v1 Announce Type: cross Abstract: Cycles $C_1,\ldots,C_k$ in a graph are called nested without geometric crossings if they are pairwise edge-disjoint, $V(C_k)\subseteq\cdots\subseteq V(C_1)$, and each…
arXiv:2601.22365v3 Announce Type: replace Abstract: The Gilbert-Pollak Conjecture \citep{gilbert1968steiner}, also known as the Steiner Ratio Conjecture, states that for any finite point set in the Euclidean plane, the…
arXiv:2512.06878v2 Announce Type: replace-cross Abstract: In this paper, we characterize finite graphs with circular chromatic number less than 3 in terms of the existence of certain signings ($\mathbb Z_2$-labellings…
arXiv:2609.02080v1 Announce Type: cross Abstract: The basis number $\mathrm{bn}(G)$ of a graph $G$ is the minimum edge-congestion of a basis of its cycle space. We prove that every finite $n$-vertex multigraph satisfies…
Showing 1 day · 38 items available
