No article text was recorded for this version.
logarithmic factor removal
Version 1 of 151 papers56 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Geometric and Functional Inequalities for Log-Concave Probability Sequences
- Blog: Eldan's stochastic localization and the KLS conjecture: Isoperimetry, concentration and mixing
- Blog: Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev
- Blog: Open problem: log(n) factor in "Local Glivenko-Cantelli
- Blog: Nearly Tight Bounds for Sandpile Transience on the Grid
- Blog: Compactly supported shearlets are optimally sparse
- Blog: Dynamic Averaging Load Balancing on Cycles
- Blog: Online Lewis Weight Sampling
- Blog: Approximate near neighbors for general symmetric norms
- Blog: Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples
- Blog: Almost quartic lower bound for the Fröhlich polaron’s effective mass via Gaussian domination
- Blog: Instance and Output Optimal Parallel Algorithms for Acyclic Joins
- Blog: Improved Bounds for Geometric Permutations
- Blog: Concentration bounds for the empirical angular measure with statistical learning applications
- Blog: Using Submodular Optimization to Approximate Minimum-Size Abductive Path Explanations for Tree-Based Models
- Blog: Euclidean distortion and the sparsest cut
- Blog: Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
- Blog: Dial a Ride from k -Forest
- Blog: Anticoncentration and the Exact Gap-Hamming Problem
- Blog: Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
- Blog: Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing
- Blog: Tight Bounds for the Subspace Sketch Problem with Applications
- Blog: Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs
- Blog: A New Information Complexity Measure for Multi-pass Streaming with Applications
- Blog: K -Dimensional Coding Schemes in Hilbert Spaces
- Blog: Congestion-Approximators from the Bottom Up
- Blog: Near Minimax Line Spectral Estimation
- Blog: Strong Gaussian Approximation for the Sum of Random Vectors
- Blog: Chaining Bounds for Empirical Risk Minimization
- Blog: Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay
- Blog: Approximation rates of entropic maps in semidiscrete optimal transport
- Blog: Boolean Compressed Sensing and Noisy Group Testing
- Blog: A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model
- Blog: Improved bounds for the sunflower lemma
- Blog: Better and Simpler Lower Bounds for Differentially Private Statistical Estimation
- Blog: A new coreset framework for clustering
- Blog: Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
- Blog: Optimal change-point estimation from indirect observations
- Blog: Marčenko-Pastur law for Tyler's M-estimator
- Blog: A Ramsey-type problem and the Turán numbers
- Blog: Gaussian Regression with Convex Constraints
- Blog: Erdös-Pósa Property of Obstructions to Interval Graphs
- Blog: A Tight VC-Dimension Analysis of Clustering Coresets with Applications
- Blog: Towards Optimal Lower Bounds for k-median and k-means Coresets
- Blog: Space Lower Bounds for Itemset Frequency Sketches
- Blog: A convex optimization approach to high-dimensional sparse quadratic discriminant analysis
- Blog: Adaptation to the Range in K-Armed Bandits
- Blog: A Bernstein-type inequality for some mixing processes and dynamical systems with an application to learning
- Blog: Nearly optimal central limit theorem and bootstrap approximations in high dimensions
- Blog: Smoothness, Low Noise and Fast Rates
- Blog: Matrix Completion With Column Manipulation: Near-Optimal Sample-Robustness-Rank Tradeoffs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_logarithmic_factor_removal_63383e79,
title = {logarithmic factor removal},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/logarithmic-factor-removal/rdr_63383e79166a45378a174792f7be0560},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_logarithmic_factor_removal_63383e79_v1,
title = {logarithmic factor removal},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/logarithmic-factor-removal/rdr_63383e79166a45378a174792f7be0560/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}