Accelerating the Multiplicative-Weights Framework for Graph Linear Programs
Accelerated multiplicative-weight updates framework for solving packing/covering LPs in graph optimization, reducing iterations from Θ(m) to ~Θ(√m) using a packing version of Min-IP oracle.
Recent Progress on Sublinear Time Algorithms for Maximum Matching - Lower Bounds
Explore recent techniques for estimating maximum matching size, focusing on lower bounds and correlation decay methods that lead to super-linear lower bounds for approximations above 2/3.
Ethical Artificial Intelligence: Oxymoron or Possibility?
Exploring ethical AI in healthcare: balancing rapid data analysis with concerns about bias, regulation, and fairness to advance health equity and address algorithmic decision-making challenges.
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes
Explore efficient interactive coding techniques using hard-to-decode tree codes, focusing on deterministic approaches and their applications in communication protocols.
Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization
Explore advanced techniques for solving stochastic minimum norm combinatorial optimization problems, focusing on approximation algorithms and their applications in complex decision-making scenarios.
General Framework for Metric Optimization Problems with Delay or Deadlines
Explore a comprehensive framework for solving metric optimization problems involving delays or deadlines, enhancing problem-solving skills in complex scenarios.
Strings and Geometry in Computer Science - Session 6C
Explore advanced concepts in strings and geometry, focusing on cutting-edge research and applications in computer science and mathematics.
Scheduling and Data Structures - Session 5B
Explore advanced scheduling algorithms and data structures in this IEEE session, focusing on cutting-edge research and practical applications in computer science.
A Unified Approach for Reverse Data Management Problems
Unified algorithm for reverse data management problems using ILP/LPs, solving both known and new cases efficiently while providing insights into complexity and tractability.
Theoretical and Practical Insights from Linear Transformers
Explore theoretical proofs and empirical observations on Linear Transformers, shedding light on their ability to learn in-context and optimize like full-fledged Transformers.
Beyond NTK- A Mean-Field Analysis of Neural Networks with Polynomial Width, Samples, and Time
Explore mean-field analysis of neural networks, examining polynomial width, samples, and time beyond Neural Tangent Kernel (NTK) theory for advanced optimization and algorithm design.
Hitting the High-Dimensional Notes - An ODE for SGD Learning Dynamics in High-Dimensions
Explore stochastic optimization algorithms in high dimensions, analyzing dynamics and performance of SGD and momentum methods using a framework inspired by random matrix theory.
Privacy-Enhancing Machine Learning
Explore privacy-enhancing techniques in machine learning, focusing on methods to protect sensitive data while maintaining model accuracy and utility.
AI and Cryptanalysis - GHTC 2023 Round Table 2
Explore the intersection of AI and cryptanalysis in this expert roundtable discussion from the Glowing Hot Topics in Cryptography workshop, examining cutting-edge developments and future implications.
Homomorphic Encryption - CHES 2023
Explore cutting-edge advancements in homomorphic encryption at CHES 2023, featuring expert insights and the latest research in secure computation techniques.
Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems
Explore advanced algorithms for graph reachability and distance problems, focusing on fine-grained complexity analysis and innovative design techniques.
Security Proofs in Cryptography
Explore advanced techniques in cryptographic security proofs, covering latest developments and methodologies in the field of fast software encryption.
New Designs and Efficient Implementations in Cryptography - Session 16
Explore innovative cryptographic designs and efficient implementation strategies for enhanced security and performance.
Robust Learning of a Single Neuron via Sharpness
Explores cyclic block coordinate methods in optimization, presenting novel perspectives and improved algorithms that break long-standing computational barriers, with applications in statistical learning.
Tight Bounds for Active LP Regression and Beyond
Explore optimization techniques and algorithm design for active lp regression, focusing on tight bounds and their applications in various computational domains.
The Complexity of Dynamic Least-Squares Regression
Explores complexity of dynamic least-squares regression, proving sharp separations in update time and presenting lower bounds through gap-amplification reduction from Online Matrix Vector Conjecture.