O(\Bar{K}\Log N)$

Ask about this topic

Momentum

1 paper in the last four weeks, down 75% on the four weeks before. 0.0% of all new papers.

Jul 6Week of Sep 21
View on map

Latest papers 27

All topics
CardsList

  1. Query-efficient winner prediction in district-based elections

    Sep 30, 2026Koustav De, Debajyoti Kar, Swagato SanyalElectionsMajority Voting

    Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, India · Department of Computer Science and Automation, Indian Institute of Science Bengaluru, India · School of Computer Science, University of Sheffield, United Kingdom

  2. Component-Weighted Centroid Search for Exact Incremental BPE

    Sep 30, 2026Harshit Verma, Rex YingByte-Pair EncodingBounded-Memory

    Yale University

  3. Non-Adaptive Learning of Sparse Erdős--Rényi Graphs via Affine Splitting

    Sep 27, 2026Hoang TaO(\Bar{K}\Log N)$Inhomogeneous Random Graphs

    Department of Computer Science, Hanoi University of Science and Technology, Vietnam

  4. Hypothesis Testing with Conditional Queries: Learnability and the Value of Interaction

    Aug 6, 2026Zonghuan XuO(\Bar{K}\Log N)$Two-Sample Testing

    Fudan University

  5. Separating quantum circuits from classical LLMs

    Aug 4, 2026Srinivasan Arunachalam, Arkopal Dutt, Hari Krovi +1Quantum CircuitsLarge Language Model Quantization

    IBM Research

  6. Quality Control Algorithms for Pattern Counting

    Aug 4, 2026Cassandra Marcussen, Ronitt Rubinfeld, Madhu SudanO(\Bar{K}\Log N)$Worst-Case

    School of Engineering and Applied Sciences, Harvard University, Cambridge, Massachusetts, USA. · Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, Massachusetts, USA.

  7. Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds

    Aug 3, 2026Deeparnab Chakrabarty, Aditi Dudeja, David SaulpicO(\Bar{K}\Log N)$Partitioning

    Dartmouth College · The Chinese University of Hong Kong (Shenzhen) · CNRS and Universit´e Paris Cit´e

  8. Publicly-Verifiable Certificates for Statistical Algorithms

    Jul 17, 2026Michael Ngo, Michael P. KimZero-Knowledge ProofsCertificates

    MIT · Research completed while at Cornell University, supported by the Bowers Undergraduate Research Experience (BURE) and the Dean Archer Undergraduate Research Program. · Cornell University

  9. Learning Partition Trees for Nearest Neighbor Search

    Jul 10, 2026Sanjeev Khanna, Ashwin Padaki, Erik WaingartenApproximate Nearest-Neighbor SearchO(\Bar{K}\Log N)$

    NYU · University of Pennsylvania

  10. The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting

    Jul 1, 2026Konstantina Bairaktari, Kasper Green LarsenStandard Differential-PrivacyO(\Bar{K}\Log N)$

    Department of Computer Science, Aarhus University.

  11. Breaking chains with trees: Deep learning with O(log⁡N)\mathcal{O}(\log N) parallel time complexity

    Jun 19, 2026Neeraj Mohan Sushma, Aditya Nagarsekar, Cabrel Teguemne Fokam +4Deep Learning ArchitecturesBackpropagation

    Center for Cognitive Interaction Technology, Bielefeld University, Germany · Ruhr Universität Bochum, Germany · Birla Institute of Technology and Science, Pilani, Goa Campus +1

  12. Recovery thresholds for hidden weighted sparse graphs

    Jun 12, 2026Zhe Hou, Jingcheng LiuInhomogeneous Random GraphsInformation-Theoretic Limits

    State Key Laboratory for Novel Software Technology, Nanjing University

  13. Query-Limited Community Recovery in Stochastic Block Models

    Jun 1, 2026Sabyasachi Basu, Manuj Mukherjee, Lutz Oettershagen +1O(\Bar{K}\Log N)$Subgraphs

    1Microsoft Research, India · 2Indraprastha Institute of Information Technology, India · University of Liverpool, United Kingdom +1

  14. Efficient Banzhaf-Based Data Valuation for kk-Nearest Neighbors Classification

    May 20, 2026Guangyi Zhang, Lutz Oettershagen, Lixu Wang +1Approximate Nearest-Neighbor SearchO(\Bar{K}\Log N)$

    Shenzhen Technology University Shenzhen, China · University of Liverpool Liverpool, United Kingdom · Nanyang Technological University Singapore +1

  15. Optimal Reconstruction from Linear Queries

    May 19, 2026Yuval Filmus, Shay Moran, Elizaveta NesterovaReconstruction ErrorO(\Bar{K}\Log N)$

    Technion – Israel Institute of Technology · Google Research

  16. Iterative Chow Filtering for Learning with Distribution Shift

    May 17, 2026Gautam Chandrasekaran, Georgios Gkrinias, Adam R. Klivans +2O(\Bar{K}\Log N)$Distribution Shifts

    UT Austin

  17. What is Learnable in Valiant's Theory of the Learnable?

    May 13, 2026Steve Hanneke, Anay Mehrotra, Grigoris Velegkas +1LearnabilityO(\Bar{K}\Log N)$

    Purdue University · Stanford University · Google Research +1

  18. Unveiling High-Probability Generalization in Decentralized SGD

    May 11, 2026Jiahuan Wang, Ping Luo, Ziqing Wen +2Stochastic Gradient DescentGeneralization Bounds

    College of Computer Science and Technology National University of Defense Technology Changsha, Hunan 410073, China

  19. On the Complexity of the Matching Problem of Regular Expressions with Backreferences

    May 8, 2026Soh Kumabe, Yuya UezatoO(\Bar{K}\Log N)$

    CyberAgent, Inc., Japan. · National Institute of Informatics, Japan.

  20. Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift

    May 7, 2026Adam R. Klivans, Shyamal Patel, Konstantinos Stavropoulos +1LearnabilityDistribution Shifts

    UT Austin · Columbia University

  21. Online learning with Erdős-Rényi side-observation graphs

    Apr 28, 2026Tomáš Kocák, Gergely Neu, Michal ValkoBanditsO(\Bar{K}\Log N)$

    SequeL team INRIA Lille - Nord Europe · Universitat Pompeu Fabra Barcelona, Spain

  22. Tight Bounds for Learning Polyhedra with a Margin

    Apr 16, 2026Shyamal Patel, Santosh VempalaO(\Bar{K}\Log N)$Polytopes

    Columbia University · Georgia Tech

  23. A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs

    Nov 21, 2025Hoang Ta, Jonathan ScarlettO(\Bar{K}\Log N)$Inhomogeneous Random Graphs

    Department of Computer Science, School of Computing, National University of Singapore (NUS), Singapore 117417 · Department of Computer Science, Hanoi University of Science and Technology, Vietnam · Department of Computer Science, Department of Mathematics, and Institute of Data Science, NUS, Singapore 117417

  24. Smooth Quasar-Convex Optimization with Constraints

    Oct 2, 2025David Martínez-RubioNonconvexRiemannian Optimization

    IMDEA Software Institute · Madrid, Spain

  25. Actively Learning Halfspaces without Synthetic Data

    Sep 25, 2025Hadley Black, Kasper Green Larsen, Arya Mazumdar +2O(\Bar{K}\Log N)$Synthetic Data

    Baruch College, CUNY · Aarhus University · University of California, San Diego

  26. Interactive proofs for verifying (quantum) learning and testing

    Oct 31, 2024Matthias C. Caro, Jens Eisert, Marcel Hinsche +3Quantum LearningPost-Quantum Cryptography

    Department of Computer Science, University of Warwick, UK · Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, Berlin, Germany · Helmholtz-Zentrum Berlin für Materialien und Energie, Berlin, Germany +4

  27. Clustering with Non-adaptive Subset Queries

    Sep 17, 2024Hadley Black, Euiwoong Lee, Arya Mazumdar +1O(\Bar{K}\Log N)$Clustering

    CUNY Baruch College · University of Michigan · UC San Diego