Shachar Lovett

发表

Correlation bounds for poly-size AC 0 circuits with n 1-o(1) symmetric gates

Shachar Lovett, S. Srinivasan, 2011 .

Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 - o(1) Symmetric Gates

Shachar Lovett, Srikanth Srinivasan, Shachar Lovett, 2011, APPROX-RANDOM.

2 Fractional PRG as steps in a random walk

Shachar Lovett, Eshan Chattopadhyay, Pooya Hatami, 2018 .

Eigenstripping, Spectral Decay, and Edge-Expansion on Posets

T. Kaufman, Shachar Lovett, Max Hopkins, 2022, 2205.00644.

Probabilistic existence of large sets of designs

Shachar Lovett, Alexander Vardy, Sankeerth Rao, 2018, J. Comb. Theory, Ser. A.

Probabilistic existence of rigid combinatorial structure s (extended abstract version)

G. Kuperberg, Shachar Lovett, R. Peled, 2012 .

Structure of Protocols for XOR Functions

Shachar Lovett, Hamed Hatami, Kaave Hosseini, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Hypercontractivity on high dimensional expanders

Shachar Lovett, Tali Kaufman, Mitali Bafna, 2021, Electron. Colloquium Comput. Complex..

Computational-Statistical Gaps in Reinforcement Learning

Gaurav Mahajan, D. Kane, Shachar Lovett, 2022, ArXiv.

Sampling Equilibria: Fast No-Regret Learning in Structured Games

Shachar Lovett, Daniel Kane, Max Hopkins, 2022, SODA.

Realizable Learning is All You Need

D. Kane, Shachar Lovett, Max Hopkins, 2021, COLT.

PSP volume 99 issue 3 Cover and Back matter

Shachar Lovett, Kaave Hosseini, 1986, Mathematical Proceedings of the Cambridge Philosophical Society.

N ov 2 01 1 Probabilistic existence of rigid combinatorial structures ( extended abstract version )

G. Kuperberg, Shachar Lovett, R. Peled, 2012 .

The Complexity of Boolean Functions in Different Characteristics

Shachar Lovett, Parikshit Gopalan, Amir Shpilka, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

The analytic rank of tensors and its applications

Shachar Lovett, 2018, 1806.09179.

An improved lower bound for arithmetic regularity

A. Shapira, Shachar Lovett, Guy Moshkovitz, 2014, Mathematical Proceedings of the Cambridge Philosophical Society.

Almost k-Wise vs. k-Wise Independent Permutations, and Uniformity for General Group Actions

Noga Alon, Shachar Lovett, N. Alon, 2012, Theory Comput..

Towards a combinatorial characterization of bounded memory learning pdf

Shachar Lovett, Alon Gonen, Michal Moshkovitz, 2020, NeurIPS.

Streaming Lower Bounds and Asymmetric Set-Disjointness

Shachar Lovett, Jiapeng Zhang, 2023, 2301.05658.

Pseudorandom Generators from Polarizing Random Walks

Shachar Lovett, Pooya Hatami, Eshan Chattopadhyay, 2018, Electron. Colloquium Comput. Complex..

Recent Advances on the Log-Rank Conjecture in Communication Complexity

Shachar Lovett, Shachar Lovett, 2014, Bull. EATCS.

Worst Case to Average Case Reductions for Polynomials

Shachar Lovett, Tali Kaufman, T. Kaufman, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Pseudorandom Bit Generators That Fool Modular Sums

Shachar Lovett, Luca Trevisan, Omer Reingold, 2009, APPROX-RANDOM.

The Complexity of Boolean Functions in Different Characteristics

Shachar Lovett, Parikshit Gopalan, Amir Shpilka, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

Constructive Discrepancy Minimization by Walking on the Edges

Shachar Lovett, Raghu Meka, Raghu Meka, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Small (weighted) families of k-wise independent permutations

N. Alon, Shachar Lovett, 2011 .

Nontrivial t-designs over finite fields exist for all t

Arman Fazeli, Shachar Lovett, Alexander Vardy, 2013, Electron. Colloquium Comput. Complex..

Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem

Shachar Lovett, Roy Schwartz, Edo Liberty, 2012, COLT.

On the Furthest Hyperplane Problem and Maximal Margin Clustering pdf

Shachar Lovett, Edo Liberty, Omri Weinstein, 2011, ArXiv.

Rectangles Are Nonnegative Juntas

Shachar Lovett, David Zuckerman, Thomas Watson, 2015, SIAM J. Comput..

Do PAC-Learners Learn the Marginal Distribution?

D. Kane, Shachar Lovett, Max Hopkins, 2023, ArXiv.

Bounded Memory Active Learning through Enriched Queries

Shachar Lovett, Max Hopkins, Michal Moshkovitz, 2021, COLT.

Noise-tolerant, Reliable Active Classification with Comparison Queries

Shachar Lovett, Gaurav Mahajan, Max Hopkins, 2020, COLT.

The Power of Comparisons for Actively Learning Linear Classifiers pdf

Shachar Lovett, Daniel M. Kane, Max Hopkins, 2019, NeurIPS.

An Additive Combinatorics Approach Relating Rank to Communication Complexity

Shachar Lovett, Eli Ben-Sasson, Noga Ron-Zewi, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

An additive combinatorics approach to the log-rank conjecture in communication complexity pdf

Shachar Lovett, Eli Ben-Sasson, Noga Ron-Zewi, 2011, Electron. Colloquium Comput. Complex..

Bilinear Classes: A Structural Framework for Provable Generalization in RL

Shachar Lovett, Sham M. Kakade, Simon S. Du, 2021, ICML.

Unconditional pseudorandom generators for low degree polynomials

Shachar Lovett, Shachar Lovett, 2008, Theory Comput..

Communication is Bounded by Root of Rank

Shachar Lovett, 2016, J. ACM.

Communication is bounded by root of rank

Shachar Lovett, Shachar Lovett, 2013, STOC.

En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations

Shachar Lovett, Dmitry Gavinsky, Dmitry Gavinsky, 2014, ICALP.

The Gram-Schmidt walk: a cure for the Banaszczyk blues

Shachar Lovett, Nikhil Bansal, Daniel Dadush, 2017, STOC.

On the Beck‐Fiala conjecture for random set systems

Shachar Lovett, Esther Ezra, Esther Ezra, 2015, Electron. Colloquium Comput. Complex..

Weight Distribution and List-Decoding Size of Reed–Muller Codes

Shachar Lovett, Ely Porat, Tali Kaufman, 2012, IEEE Transactions on Information Theory.

Additive Combinatorics and its Applications in Theoretical Computer Science

Shachar Lovett, Shachar Lovett, 2017, Theory Comput..

Active Classification with Comparison Queries

Shachar Lovett, Shay Moran, Daniel M. Kane, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields

Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Probabilistic existence of regular combinatorial structures

Shachar Lovett, Greg Kuperberg, Ron Peled, 2011, ArXiv.

Higher-order Fourier Analysis and Applications

Shachar Lovett, Pooya Hatami, Hamed Hatami, 2019, Found. Trends Theor. Comput. Sci..

The Fourier structure of low degree polynomials

Shachar Lovett, Shachar Lovett, 2016, Electron. Colloquium Comput. Complex..

General systems of linear forms: equidistribution and true complexity

Shachar Lovett, Pooya Hatami, Hamed Hatami, 2014, Electron. Colloquium Comput. Complex..

Correlation testing for affine invariant properties on Fpn in the high error regime

Shachar Lovett, Hamed Hatami, Hamed Hatami, 2011, STOC '11.

Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime pdf

Shachar Lovett, Hamed Hatami, Hamed Hatami, 2011, ArXiv.

Higher-order Fourier analysis of $\mathbb{F}_p^n$ and the complexity of systems of linear forms

Shachar Lovett, Hamed Hatami, Hamed Hatami, 2010, 1011.4600.

C C ] 1 2 A ug 2 01 3 Correlation Testing for Affine Invariant Properties on F n p in the High Error Regime ∗

Hamed Hatami, Shachar Lovett, 2021 .

Higher-order Fourier analysis of Fpn and the complexity of systems of linear forms

Shachar Lovett, Hamed Hatami, Hamed Hatami, 2010, Electron. Colloquium Comput. Complex..

Inverse conjecture for the gowers norm is false

Shachar Lovett, Alex Samorodnitsky, Roy Meshulam, 2007, Theory Comput..

Random low-degree polynomials are hard to approximate

Shachar Lovett, Rani Hod, Ido Ben-Eliezer, 2009, computational complexity.

Exponential Hardness of Reinforcement Learning with Linear Function Approximation

Csaba Szepesvari, G. Weisz, Shachar Lovett, 2023, COLT.

New Lower Bounds for Matching Vector Codes pdf

Shachar Lovett, Zeev Dvir, Abhishek Bhowmick, 2012, Electron. Colloquium Comput. Complex..

Subspace evasive sets

Shachar Lovett, Zeev Dvir, 2011, STOC '12.

Realizable Learning is All You Need

D. Kane, Shachar Lovett, Max Hopkins, 2021, COLT.

Algebraic attacks against random local functions and their countermeasures

Shachar Lovett, Benny Applebaum, Shachar Lovett, 2016, SIAM J. Comput..

Linear Systems over Finite Abelian Groups

Shachar Lovett, Arkadev Chattopadhyay, A. Chattopadhyay, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits

Shachar Lovett, Sasha Sodin, S. Sodin, 2007, Electron. Colloquium Comput. Complex..

Non-malleable codes from additive combinatorics

Shachar Lovett, Yevgeniy Dodis, Divesh Aggarwal, 2014, STOC.

Affine-malleable extractors, spectrum doubling, and application to privacy amplification

Shachar Lovett, Divesh Aggarwal, Kaave Hosseini, 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory

Abhishek Bhowmick, Shachar Lovett, 2015, IEEE Transactions on Information Theory.

Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory

Shachar Lovett, Abhishek Bhowmick, Abhishek Bhowmick, 2015, Electron. Colloquium Comput. Complex..

Bounded-Depth Circuits Cannot Sample Good Codes

Shachar Lovett, Emanuele Viola, Emanuele Viola, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

Cooperative weakest link games

Morteza Zadimoghaddam, Omer Lev, Shachar Lovett, 2014, AAMAS.

High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games

Shachar Lovett, Tali Kaufman, Mitali Bafna, 2020, SODA.

Fractional pseudorandom generators from any fourier level pdf

Shachar Lovett, Eshan Chattopadhyay, Chin Ho Lee, 2020, CCC.

Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates

Shachar Lovett, Avishay Tal, Pooya Hatami, 2018, Electron. Colloquium Comput. Complex..

Testing of exponentially large codes, by a new extension to Weil bound for character sums

Shachar Lovett, Tali Kaufman, T. Kaufman, 2010, Electron. Colloquium Comput. Complex..

Eigenstripping, Spectral Decay, and Edge-Expansion on Posets

T. Kaufman, Shachar Lovett, Max Hopkins, 2022, APPROX/RANDOM.

Optimality of linear sketching under modular updates

Shachar Lovett, Grigory Yaroslavtsev, Kaave Hosseini, 2018, Electron. Colloquium Comput. Complex..

Singularity of Random Integer Matrices with Large Entries

Shachar Lovett, Sankeerth Rao Karingula, Shachar Lovett, 2020, APPROX-RANDOM.

Codes over integers, and the singularity of random matrices with large entries

Shachar Lovett, Sankeerth Rao Karingula, Shachar Lovett, 2020, Electron. Colloquium Comput. Complex..

Improved bounds for the sunflower lemma

Shachar Lovett, Kewen Wu, Jiapeng Zhang, 2019, Electron. Colloquium Comput. Complex..

Variety Evasive Sets

J. Kollár, Shachar Lovett, Zeev Dvir, 2012, Computational Complexity.

Variety Evasive Sets

Shachar Lovett, Zeev Dvir, János Kollár, 2013, computational complexity.

Subspace Evasive Sets

Shachar Lovett, Zeev Dvir, Shachar Lovett, 2011, Electron. Colloquium Comput. Complex..

Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem pdf

Shachar Lovett, Aleksandar Nikolov, Daniel Dadush, 2016, APPROX-RANDOM.

A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds

Shachar Lovett, Kaave Hosseini, Shachar Lovett, 2018, Electron. Colloquium Comput. Complex..

A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space

O. Regev, Shachar Lovett, 2016, 1612.03332.

On the structure of the spectrum of small sets

Shachar Lovett, Kaave Hosseini, Shachar Lovett, 2015, J. Comb. Theory, Ser. A.

Subspace evasive sets

Shachar Lovett, Zeev Dvir, 2011, STOC '12.

Algebraic attacks against random local functions and their countermeasures

Shachar Lovett, B. Applebaum, 2016, SIAM J. Comput..

Near-optimal Linear Decision Trees for k-SUM and Related Problems

Shachar Lovett, Shay Moran, Daniel M. Kane, 2019, J. ACM.

Near-optimal linear decision trees for k-SUM and related problems

Shachar Lovett, Shay Moran, Daniel M. Kane, 2017, Electron. Colloquium Comput. Complex..

Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-Circuits

Shachar Lovett, Russell Impagliazzo, Chris Beck, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Fractional certificates for bounded functions

Shachar Lovett, Jiapeng Zhang, 2022, Electron. Colloquium Comput. Complex..

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms

Shachar Lovett, R. Meka, Zander Kelley, 2023, Electron. Colloquium Comput. Complex..

Explicit separations between randomized and deterministic Number-on-Forehead communication

Shachar Lovett, R. Meka, Zander Kelley, 2023, Electron. Colloquium Comput. Complex..

Higher-Order Fourier Analysis Of $${\mathbb{F}_{p}^n}$$ And The Complexity Of Systems Of Linear Forms

Hamed Hatami, Shachar Lovett, 2011 .

Large Supports are required for Well-Supported Nash Equilibria pdf

Shachar Lovett, Hao Huang, Adrian Vetta, 2015, APPROX-RANDOM.

An Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem

Shachar Lovett, Shachar Lovett, 2015, Theory Comput..

Equivalence of polynomial conjectures in additive combinatorics

Shachar Lovett, Shachar Lovett, 2010, Combinatorica.

Point Location and Active Learning: Learning Halfspaces Almost Optimally

Shachar Lovett, Daniel M. Kane, Gaurav Mahajan, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Generalized comparison trees for point-location problems

D. Kane, S. Moran, Shachar Lovett, 2018, Electron. Colloquium Comput. Complex..

The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes

Shachar Lovett, Sankeerth Rao, Daniel Kane, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Communication is Bounded by Root of Rank

Shachar Lovett, 2016, J. ACM.

Subspace evasive sets

Shachar Lovett, Zeev Dvir, 2011, STOC '12.

On cryptography with auxiliary input

Yael Tauman Kalai, Shachar Lovett, Yevgeniy Dodis, 2009, STOC '09.

The List Decoding Radius for Reed-Muller Codes Over Small Fields

Shachar Lovett, Abhishek Bhowmick, Abhishek Bhowmick, 2018, IEEE Trans. Inf. Theory.