iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.uni-trier.de/pid/47/7934.rss
dblp: Pravesh Kothari https://dblp.org/pid/47/7934.html dblp person page RSS feed Mon, 25 Nov 2024 23:45:40 +0100 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Pravesh Kotharihttps://dblp.org/pid/47/7934.html14451 New SDP Roundings and Certifiable Approximation for Cubic Optimization.https://doi.org/10.1137/1.9781611977912.83, , , :
New SDP Roundings and Certifiable Approximation for Cubic Optimization. SODA : 2337-2362]]>https://dblp.org/rec/conf/soda/HsiehKPT24Mon, 01 Jan 2024 00:00:00 +0100 An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes.https://doi.org/10.1145/3618260.3649640, :
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. STOC : 776-787]]>https://dblp.org/rec/conf/stoc/KothariM24Mon, 01 Jan 2024 00:00:00 +0100 Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs.https://doi.org/10.1145/3618260.3649703, , :
Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs. STOC : 1923-1934]]>https://dblp.org/rec/conf/stoc/KothariPX24Mon, 01 Jan 2024 00:00:00 +0100 Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs.https://doi.org/10.48550/arXiv.2401.11590, , , , :
Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs. CoRR abs/2401.11590 ()]]>https://dblp.org/rec/journals/corr/abs-2401-11590Mon, 01 Jan 2024 00:00:00 +0100 Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs.https://doi.org/10.48550/arXiv.2404.06513, :
Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs. CoRR abs/2404.06513 ()]]>https://dblp.org/rec/journals/corr/abs-2404-06513Mon, 01 Jan 2024 00:00:00 +0100 Semirandom Planted Clique and the Restricted Isometry Property.https://doi.org/10.48550/arXiv.2404.14159, , , :
Semirandom Planted Clique and the Restricted Isometry Property. CoRR abs/2404.14159 ()]]>https://dblp.org/rec/journals/corr/abs-2404-14159Mon, 01 Jan 2024 00:00:00 +0100 Rounding Large Independent Sets on Expanders.https://doi.org/10.48550/arXiv.2405.10238, , :
Rounding Large Independent Sets on Expanders. CoRR abs/2405.10238 ()]]>https://dblp.org/rec/journals/corr/abs-2405-10238Mon, 01 Jan 2024 00:00:00 +0100 Efficient Certificates of Anti-Concentration Beyond Gaussians.https://doi.org/10.48550/arXiv.2405.15084, , , , :
Efficient Certificates of Anti-Concentration Beyond Gaussians. CoRR abs/2405.15084 ()]]>https://dblp.org/rec/journals/corr/abs-2405-15084Mon, 01 Jan 2024 00:00:00 +0100 Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs.https://doi.org/10.48550/arXiv.2406.18429, , :
Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs. CoRR abs/2406.18429 ()]]>https://dblp.org/rec/journals/corr/abs-2406-18429Mon, 01 Jan 2024 00:00:00 +0100 Improved Lower Bounds for all Odd-Query Locally Decodable Codes.https://eccc.weizmann.ac.il/report/2024/189, , , :
Improved Lower Bounds for all Odd-Query Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR24: TR24-189 ()]]>https://dblp.org/rec/journals/eccc/BasuHKL24Mon, 01 Jan 2024 00:00:00 +0100 Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs.https://eccc.weizmann.ac.il/report/2024/068, :
Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs. Electron. Colloquium Comput. Complex. TR24 ()]]>https://dblp.org/rec/journals/eccc/KothariM24Mon, 01 Jan 2024 00:00:00 +0100 Is Planted Coloring Easier than Planted Clique?https://proceedings.mlr.press/v195/kothari23a.html, , , :
Is Planted Coloring Easier than Planted Clique? COLT : 5343-5372]]>https://dblp.org/rec/conf/colt/KothariVWX23Sun, 01 Jan 2023 00:00:00 +0100 Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold.https://doi.org/10.1109/FOCS57990.2023.00026, , , :
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold. FOCS : 307-327]]>https://dblp.org/rec/conf/focs/GuruswamiHKM23Sun, 01 Jan 2023 00:00:00 +0100 Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal Error.https://doi.org/10.1109/FOCS57990.2023.00147, , :
Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal Error. FOCS : 2408-2429]]>https://dblp.org/rec/conf/focs/JiaKV23Sun, 01 Jan 2023 00:00:00 +0100 Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm.https://doi.org/10.4230/LIPIcs.ICALP.2023.77, :
Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm. ICALP : 77:1-77:7]]>https://dblp.org/rec/conf/icalp/HsiehK23Sun, 01 Jan 2023 00:00:00 +0100 Ellipsoid Fitting up to a Constant.https://doi.org/10.4230/LIPIcs.ICALP.2023.78, , , :
Ellipsoid Fitting up to a Constant. ICALP : 78:1-78:20]]>https://dblp.org/rec/conf/icalp/HsiehKPX23Sun, 01 Jan 2023 00:00:00 +0100 A simple and sharper proof of the hypergraph Moore bound.https://doi.org/10.1137/1.9781611977554.ch89, , :
A simple and sharper proof of the hypergraph Moore bound. SODA : 2324-2344]]>https://dblp.org/rec/conf/soda/HsiehKM23Sun, 01 Jan 2023 00:00:00 +0100 Privately Estimating a Gaussian: Efficient, Robust, and Optimal.https://doi.org/10.1145/3564246.3585194, , , , :
Privately Estimating a Gaussian: Efficient, Robust, and Optimal. STOC : 483-496]]>https://dblp.org/rec/conf/stoc/AlabiKTVZ23Sun, 01 Jan 2023 00:00:00 +0100 A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.https://doi.org/10.1145/3564246.3585143, , , :
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. STOC : 1438-1448]]>https://dblp.org/rec/conf/stoc/AlrabiahGKM23Sun, 01 Jan 2023 00:00:00 +0100 A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity.https://doi.org/10.1145/3564246.3585206, , :
A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity. STOC : 1657-1670]]>https://dblp.org/rec/conf/stoc/GollakotaKK23Sun, 01 Jan 2023 00:00:00 +0100 Algorithms Approaching the Threshold for Semi-random Planted Clique.https://doi.org/10.1145/3564246.3585184, , :
Algorithms Approaching the Threshold for Semi-random Planted Clique. STOC : 1918-1926]]>https://dblp.org/rec/conf/stoc/BuhaiKS23Sun, 01 Jan 2023 00:00:00 +0100 Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method.https://doi.org/10.1007/978-3-031-48615-9_10, , :
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. TCC (1) : 268-285]]>https://dblp.org/rec/conf/tcc/BogdanovKR23Sun, 01 Jan 2023 00:00:00 +0100 Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal Error.https://doi.org/10.48550/arXiv.2302.12289, , :
Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal Error. CoRR abs/2302.12289 ()]]>https://dblp.org/rec/journals/corr/abs-2302-12289Sun, 01 Jan 2023 00:00:00 +0100 Is Planted Coloring Easier than Planted Clique?https://doi.org/10.48550/arXiv.2303.00252, , , :
Is Planted Coloring Easier than Planted Clique? CoRR abs/2303.00252 ()]]>https://dblp.org/rec/journals/corr/abs-2303-00252Sun, 01 Jan 2023 00:00:00 +0100 Ellipsoid Fitting Up to a Constant.https://doi.org/10.48550/arXiv.2307.05954, , , :
Ellipsoid Fitting Up to a Constant. CoRR abs/2307.05954 ()]]>https://dblp.org/rec/journals/corr/abs-2307-05954Sun, 01 Jan 2023 00:00:00 +0100 A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.https://doi.org/10.48550/arXiv.2308.15403, , , :
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. CoRR abs/2308.15403 ()]]>https://dblp.org/rec/journals/corr/abs-2308-15403Sun, 01 Jan 2023 00:00:00 +0100 Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold.https://doi.org/10.48550/arXiv.2309.16897, , , :
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold. CoRR abs/2309.16897 ()]]>https://dblp.org/rec/journals/corr/abs-2309-16897Sun, 01 Jan 2023 00:00:00 +0100 New SDP Roundings and Certifiable Approximation for Cubic Optimization.https://doi.org/10.48550/arXiv.2310.00393, , , :
New SDP Roundings and Certifiable Approximation for Cubic Optimization. CoRR abs/2310.00393 ()]]>https://dblp.org/rec/journals/corr/abs-2310-00393Sun, 01 Jan 2023 00:00:00 +0100 An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes.https://doi.org/10.48550/arXiv.2311.00558, :
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. CoRR abs/2311.00558 ()]]>https://dblp.org/rec/journals/corr/abs-2311-00558Sun, 01 Jan 2023 00:00:00 +0100 Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method.https://eccc.weizmann.ac.il/report/2023/098, , :
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. Electron. Colloquium Comput. Complex. TR23 ()]]>https://dblp.org/rec/journals/eccc/BogdanovKR23Sun, 01 Jan 2023 00:00:00 +0100 An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes.https://eccc.weizmann.ac.il/report/2023/162, :
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. Electron. Colloquium Comput. Complex. TR23 ()]]>https://dblp.org/rec/journals/eccc/KothariM23Sun, 01 Jan 2023 00:00:00 +0100 Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method.https://eprint.iacr.org/2023/1049, , :
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. IACR Cryptol. ePrint Arch. 2023: 1049 ()]]>https://dblp.org/rec/journals/iacr/BogdanovKR23Sun, 01 Jan 2023 00:00:00 +0100 Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs.https://doi.org/10.1137/17m1152966, , :
Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs. SIAM J. Comput. 51(2): 17-305 ()]]>https://dblp.org/rec/journals/siamcomp/KothariMR22Sat, 01 Jan 2022 00:00:00 +0100 Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally.https://proceedings.mlr.press/v167/kothari22a.html, , :
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally. ALT : 638-667]]>https://dblp.org/rec/conf/alt/KothariMZ22Sat, 01 Jan 2022 00:00:00 +0100 Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number.https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.42, , :
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. APPROX/RANDOM : 42:1-42:7]]>https://dblp.org/rec/conf/approx/GuruswamiKM22Sat, 01 Jan 2022 00:00:00 +0100 Private Robust Estimation by Stabilizing Convex Relaxations.https://proceedings.mlr.press/v178/kothari22a.html, , :
Private Robust Estimation by Stabilizing Convex Relaxations. COLT : 723-777]]>https://dblp.org/rec/conf/colt/KothariMV22Sat, 01 Jan 2022 00:00:00 +0100 Polynomial-Time Power-Sum Decomposition of Polynomials.https://doi.org/10.1109/FOCS54457.2022.00094, , , :
Polynomial-Time Power-Sum Decomposition of Polynomials. FOCS : 956-967]]>https://dblp.org/rec/conf/focs/BafnaHKX22Sat, 01 Jan 2022 00:00:00 +0100 Strategyproofing Peer Assessment via Partitioning: The Price in Terms of Evaluators' Expertise.https://doi.org/10.1609/hcomp.v10i1.21987, , , :
Strategyproofing Peer Assessment via Partitioning: The Price in Terms of Evaluators' Expertise. HCOMP : 53-63]]>https://dblp.org/rec/conf/hcomp/DhullJKS22Sat, 01 Jan 2022 00:00:00 +0100 Algorithmic Thresholds for Refuting Random Polynomial Systems.https://doi.org/10.1137/1.9781611977073.49, :
Algorithmic Thresholds for Refuting Random Polynomial Systems. SODA : 1154-1203]]>https://dblp.org/rec/conf/soda/HsiehK22Sat, 01 Jan 2022 00:00:00 +0100 Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random.https://doi.org/10.1145/3519935.3519955, , :
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random. STOC : 678-689]]>https://dblp.org/rec/conf/stoc/GuruswamiKM22Sat, 01 Jan 2022 00:00:00 +0100 Robustly learning mixtures of k arbitrary Gaussians.https://doi.org/10.1145/3519935.3519953, , , , , :
Robustly learning mixtures of k arbitrary Gaussians. STOC : 1234-1247]]>https://dblp.org/rec/conf/stoc/BakshiDJKKV22Sat, 01 Jan 2022 00:00:00 +0100 List-decodable covariance estimation.https://doi.org/10.1145/3519935.3520006, :
List-decodable covariance estimation. STOC : 1276-1283]]>https://dblp.org/rec/conf/stoc/IvkovK22Sat, 01 Jan 2022 00:00:00 +0100 The Price of Strategyproofing Peer Assessment.https://arxiv.org/abs/2201.10631, , , :
The Price of Strategyproofing Peer Assessment. CoRR abs/2201.10631 ()]]>https://dblp.org/rec/journals/corr/abs-2201-10631Sat, 01 Jan 2022 00:00:00 +0100 Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number.https://doi.org/10.48550/arXiv.2205.06739, , :
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. CoRR abs/2205.06739 ()]]>https://dblp.org/rec/journals/corr/abs-2205-06739Sat, 01 Jan 2022 00:00:00 +0100 Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm.https://doi.org/10.48550/arXiv.2206.09204, :
Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm. CoRR abs/2206.09204 ()]]>https://dblp.org/rec/journals/corr/abs-2206-09204Sat, 01 Jan 2022 00:00:00 +0100 List-Decodable Covariance Estimation.https://doi.org/10.48550/arXiv.2206.10942, :
List-Decodable Covariance Estimation. CoRR abs/2206.10942 ()]]>https://dblp.org/rec/journals/corr/abs-2206-10942Sat, 01 Jan 2022 00:00:00 +0100 A simple and sharper proof of the hypergraph Moore bound.https://doi.org/10.48550/arXiv.2207.10850, , :
A simple and sharper proof of the hypergraph Moore bound. CoRR abs/2207.10850 ()]]>https://dblp.org/rec/journals/corr/abs-2207-10850Sat, 01 Jan 2022 00:00:00 +0100 Polynomial-Time Power-Sum Decomposition of Polynomials.https://doi.org/10.48550/arXiv.2208.00122, , , :
Polynomial-Time Power-Sum Decomposition of Polynomials. CoRR abs/2208.00122 ()]]>https://dblp.org/rec/journals/corr/abs-2208-00122Sat, 01 Jan 2022 00:00:00 +0100 A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity.https://doi.org/10.48550/arXiv.2211.13312, , :
A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity. CoRR abs/2211.13312 ()]]>https://dblp.org/rec/journals/corr/abs-2211-13312Sat, 01 Jan 2022 00:00:00 +0100 Algorithms approaching the threshold for semi-random planted clique.https://doi.org/10.48550/arXiv.2212.05619, , :
Algorithms approaching the threshold for semi-random planted clique. CoRR abs/2212.05619 ()]]>https://dblp.org/rec/journals/corr/abs-2212-05619Sat, 01 Jan 2022 00:00:00 +0100 Privately Estimating a Gaussian: Efficient, Robust and Optimal.https://doi.org/10.48550/arXiv.2212.08018, , , , :
Privately Estimating a Gaussian: Efficient, Robust and Optimal. CoRR abs/2212.08018 ()]]>https://dblp.org/rec/journals/corr/abs-2212-08018Sat, 01 Jan 2022 00:00:00 +0100 A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.https://eccc.weizmann.ac.il/report/2022/101, , , :
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. Electron. Colloquium Comput. Complex. TR22 ()]]>https://dblp.org/rec/journals/eccc/AlrabiahGKM22Sat, 01 Jan 2022 00:00:00 +0100 Memory-Sample Lower Bounds for Learning Parity with Noise.https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.60, , , :
Memory-Sample Lower Bounds for Learning Parity with Noise. APPROX-RANDOM : 60:1-60:19]]>https://dblp.org/rec/conf/approx/GargKLR21Fri, 01 Jan 2021 00:00:00 +0100 A Stress-Free Sum-Of-Squares Lower Bound for Coloring.https://doi.org/10.4230/LIPIcs.CCC.2021.23, :
A Stress-Free Sum-Of-Squares Lower Bound for Coloring. CCC : 23:1-23:21]]>https://dblp.org/rec/conf/coco/KothariM21Fri, 01 Jan 2021 00:00:00 +0100 Strongly refuting all semi-random Boolean CSPs.https://doi.org/10.1137/1.9781611976465.28, , :
Strongly refuting all semi-random Boolean CSPs. SODA : 454-472]]>https://dblp.org/rec/conf/soda/AbascalGK21Fri, 01 Jan 2021 00:00:00 +0100 List-Decodable Subspace Recovery: Dimension Independent Error in Polynomial Time.https://doi.org/10.1137/1.9781611976465.78, :
List-Decodable Subspace Recovery: Dimension Independent Error in Polynomial Time. SODA : 1279-1297]]>https://dblp.org/rec/conf/soda/BakshiK21Fri, 01 Jan 2021 00:00:00 +0100 Playing unique games on certified small-set expanders.https://doi.org/10.1145/3406325.3451099, , , , :
Playing unique games on certified small-set expanders. STOC : 1629-1642]]>https://dblp.org/rec/conf/stoc/BafnaBKSS21Fri, 01 Jan 2021 00:00:00 +0100 A Stress-Free Sum-of-Squares Lower Bound for Coloring.https://arxiv.org/abs/2105.07517, :
A Stress-Free Sum-of-Squares Lower Bound for Coloring. CoRR abs/2105.07517 ()]]>https://dblp.org/rec/journals/corr/abs-2105-07517Fri, 01 Jan 2021 00:00:00 +0100 Memory-Sample Lower Bounds for Learning Parity with Noise.https://arxiv.org/abs/2107.02320, , , :
Memory-Sample Lower Bounds for Learning Parity with Noise. CoRR abs/2107.02320 ()]]>https://dblp.org/rec/journals/corr/abs-2107-02320Fri, 01 Jan 2021 00:00:00 +0100 Algorithms and Certificates for Boolean CSP Refutation: "Smoothed is no harder than Random".https://arxiv.org/abs/2109.04415, , :
Algorithms and Certificates for Boolean CSP Refutation: "Smoothed is no harder than Random". CoRR abs/2109.04415 ()]]>https://dblp.org/rec/journals/corr/abs-2109-04415Fri, 01 Jan 2021 00:00:00 +0100 Algorithmic Thresholds for Refuting Random Polynomial Systems.https://arxiv.org/abs/2110.08677, :
Algorithmic Thresholds for Refuting Random Polynomial Systems. CoRR abs/2110.08677 ()]]>https://dblp.org/rec/journals/corr/abs-2110-08677Fri, 01 Jan 2021 00:00:00 +0100 Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally.https://arxiv.org/abs/2110.11853, , :
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally. CoRR abs/2110.11853 ()]]>https://dblp.org/rec/journals/corr/abs-2110-11853Fri, 01 Jan 2021 00:00:00 +0100 Private Robust Estimation by Stabilizing Convex Relaxations.https://arxiv.org/abs/2112.03548, , :
Private Robust Estimation by Stabilizing Convex Relaxations. CoRR abs/2112.03548 ()]]>https://dblp.org/rec/journals/corr/abs-2112-03548Fri, 01 Jan 2021 00:00:00 +0100 Tight bounds on ℓ1 approximation and learning of self-bounding functions.https://doi.org/10.1016/j.tcs.2019.11.013, , :
Tight bounds on ℓ1 approximation and learning of self-bounding functions. Theor. Comput. Sci. 808: 86-98 ()]]>https://dblp.org/rec/journals/tcs/FeldmanKV20Wed, 01 Jan 2020 00:00:00 +0100 On the Expressive Power of Kernel Methods and the Efficiency of Kernel Learning by Association Schemes.http://proceedings.mlr.press/v117/pravesh20a.html, :
On the Expressive Power of Kernel Methods and the Efficiency of Kernel Learning by Association Schemes. ALT : 422-450]]>https://dblp.org/rec/conf/alt/KothariL20Wed, 01 Jan 2020 00:00:00 +0100 Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG.https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.21, , :
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG. APPROX-RANDOM : 21:1-21:18]]>https://dblp.org/rec/conf/approx/GargKR20Wed, 01 Jan 2020 00:00:00 +0100 Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures.https://doi.org/10.1109/FOCS46700.2020.00023, , , , , :
Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures. FOCS : 149-159]]>https://dblp.org/rec/conf/focs/BakshiDHKKK20Wed, 01 Jan 2020 00:00:00 +0100 Sparse PCA: Algorithms, Adversarial Perturbations and Certificates.https://doi.org/10.1109/FOCS46700.2020.00058, , , :
Sparse PCA: Algorithms, Adversarial Perturbations and Certificates. FOCS : 553-564]]>https://dblp.org/rec/conf/focs/dOrsiKNS20Wed, 01 Jan 2020 00:00:00 +0100 List-Decodable Subspace Recovery via Sum-of-Squares.https://arxiv.org/abs/2002.05139, :
List-Decodable Subspace Recovery via Sum-of-Squares. CoRR abs/2002.05139 ()]]>https://dblp.org/rec/journals/corr/abs-2002-05139Wed, 01 Jan 2020 00:00:00 +0100 Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG.https://arxiv.org/abs/2002.07235, , :
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG. CoRR abs/2002.07235 ()]]>https://dblp.org/rec/journals/corr/abs-2002-07235Wed, 01 Jan 2020 00:00:00 +0100 Outlier-Robust Clustering of Non-Spherical Mixtures.https://arxiv.org/abs/2005.02970, :
Outlier-Robust Clustering of Non-Spherical Mixtures. CoRR abs/2005.02970 ()]]>https://dblp.org/rec/journals/corr/abs-2005-02970Wed, 01 Jan 2020 00:00:00 +0100 Playing Unique Games on Certified Small-Set Expanders.https://arxiv.org/abs/2006.09969, , , , :
Playing Unique Games on Certified Small-Set Expanders. CoRR abs/2006.09969 ()]]>https://dblp.org/rec/journals/corr/abs-2006-09969Wed, 01 Jan 2020 00:00:00 +0100 Strongly refuting all semi-random Boolean CSPs.https://arxiv.org/abs/2009.08032, , :
Strongly refuting all semi-random Boolean CSPs. CoRR abs/2009.08032 ()]]>https://dblp.org/rec/journals/corr/abs-2009-08032Wed, 01 Jan 2020 00:00:00 +0100 Sparse PCA: Algorithms, Adversarial Perturbations and Certificates.https://arxiv.org/abs/2011.06585, , , :
Sparse PCA: Algorithms, Adversarial Perturbations and Certificates. CoRR abs/2011.06585 ()]]>https://dblp.org/rec/journals/corr/abs-2011-06585Wed, 01 Jan 2020 00:00:00 +0100 Robustly Learning Mixtures of k Arbitrary Gaussians.https://arxiv.org/abs/2012.02119, , , , , :
Robustly Learning Mixtures of k Arbitrary Gaussians. CoRR abs/2012.02119 ()]]>https://dblp.org/rec/journals/corr/abs-2012-02119Wed, 01 Jan 2020 00:00:00 +0100 Semialgebraic Proofs and Efficient Algorithm Design.https://doi.org/10.1561/0400000086, , :
Semialgebraic Proofs and Efficient Algorithm Design. Found. Trends Theor. Comput. Sci. 14(1-2): 1-221 ()]]>https://dblp.org/rec/journals/fttcs/FlemingKP19Tue, 01 Jan 2019 00:00:00 +0100 A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.https://doi.org/10.1137/17M1138236, , , , , :
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. SIAM J. Comput. 48(2): 687-735 ()]]>https://dblp.org/rec/journals/siamcomp/BarakHKKMP19Tue, 01 Jan 2019 00:00:00 +0100 The Social Network Effect on Surprise in Elections.https://doi.org/10.1145/3297001.3297002, , :
The Social Network Effect on Surprise in Elections. COMAD/CODS : 1-9]]>https://dblp.org/rec/conf/comad/DeyKN19Tue, 01 Jan 2019 00:00:00 +0100 Sum-of-Squares Meets Program Obfuscation, Revisited.https://doi.org/10.1007/978-3-030-17653-2_8, , , , :
Sum-of-Squares Meets Program Obfuscation, Revisited. EUROCRYPT (1) : 226-250]]>https://dblp.org/rec/conf/eurocrypt/BarakHJKS19Tue, 01 Jan 2019 00:00:00 +0100 Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries.https://doi.org/10.1109/FOCS.2019.00023, , , , :
Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries. FOCS : 220-232]]>https://dblp.org/rec/conf/focs/Kothari0MSW19Tue, 01 Jan 2019 00:00:00 +0100 Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture.https://doi.org/10.4230/LIPIcs.ITCS.2019.9, , :
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. ITCS : 9:1-9:12]]>https://dblp.org/rec/conf/innovations/BarakKS19Tue, 01 Jan 2019 00:00:00 +0100 SOS Lower Bounds with Hard Constraints: Think Global, Act Local.https://doi.org/10.4230/LIPIcs.ITCS.2019.49, , :
SOS Lower Bounds with Hard Constraints: Think Global, Act Local. ITCS : 49:1-49:21]]>https://dblp.org/rec/conf/innovations/KothariOS19Tue, 01 Jan 2019 00:00:00 +0100 List-decodable Linear Regression.https://proceedings.neurips.cc/paper/2019/hash/7f5fc754c7af0a6370c9bf91314e79f4-Abstract.html, , :
List-decodable Linear Regression. NeurIPS : 7423-7432]]>https://dblp.org/rec/conf/nips/KarmalkarKK19Tue, 01 Jan 2019 00:00:00 +0100 On the Expressive Power of Kernel Methods and the Efficiency of Kernel Learning by Association Schemes.http://arxiv.org/abs/1902.04782, :
On the Expressive Power of Kernel Methods and the Efficiency of Kernel Learning by Association Schemes. CoRR abs/1902.04782 ()]]>https://dblp.org/rec/journals/corr/abs-1902-04782Tue, 01 Jan 2019 00:00:00 +0100 Approximation Schemes for a Buyer with Independent Items via Symmetries.http://arxiv.org/abs/1905.05231, , , , :
Approximation Schemes for a Buyer with Independent Items via Symmetries. CoRR abs/1905.05231 ()]]>https://dblp.org/rec/journals/corr/abs-1905-05231Tue, 01 Jan 2019 00:00:00 +0100 List-Decodable Linear Regression.http://arxiv.org/abs/1905.05679, , :
List-Decodable Linear Regression. CoRR abs/1905.05679 ()]]>https://dblp.org/rec/journals/corr/abs-1905-05679Tue, 01 Jan 2019 00:00:00 +0100 Semialgebraic Proofs and Efficient Algorithm Design.https://eccc.weizmann.ac.il/report/2019/106, , :
Semialgebraic Proofs and Efficient Algorithm Design. Electron. Colloquium Comput. Complex. TR19 ()]]>https://dblp.org/rec/journals/eccc/FlemingKP19Tue, 01 Jan 2019 00:00:00 +0100 Communication with Contextual Uncertainty.https://doi.org/10.1007/s00037-017-0161-3, , , :
Communication with Contextual Uncertainty. Comput. Complex. 27(3): 463-509 ()]]>https://dblp.org/rec/journals/cc/GhaziKKS18Mon, 01 Jan 2018 00:00:00 +0100 On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique.https://doi.org/10.1145/3178538, , , , :
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. ACM Trans. Algorithms 14(3): 28:1-28:31 ()]]>https://dblp.org/rec/journals/talg/HopkinsKPRS18Mon, 01 Jan 2018 00:00:00 +0100 Efficient Algorithms for Outlier-Robust Regression.http://proceedings.mlr.press/v75/klivans18a.html, , :
Efficient Algorithms for Outlier-Robust Regression. COLT : 1420-1430]]>https://dblp.org/rec/conf/colt/KlivansKM18Mon, 01 Jan 2018 00:00:00 +0100 An Analysis of the t-SNE Algorithm for Data Visualization.http://proceedings.mlr.press/v75/arora18a.html, , :
An Analysis of the t-SNE Algorithm for Data Visualization. COLT : 1455-1462]]>https://dblp.org/rec/conf/colt/AroraHK18Mon, 01 Jan 2018 00:00:00 +0100 Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation).https://doi.org/10.1007/978-3-319-78375-8_21, , , :
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). EUROCRYPT (2) : 649-679]]>https://dblp.org/rec/conf/eurocrypt/BarakBKK18Mon, 01 Jan 2018 00:00:00 +0100 Improper Learning by Refuting.https://doi.org/10.4230/LIPIcs.ITCS.2018.55, :
Improper Learning by Refuting. ITCS : 55:1-55:10]]>https://dblp.org/rec/conf/innovations/KothariL18Mon, 01 Jan 2018 00:00:00 +0100 Robust moment estimation and improved clustering via sum of squares.https://doi.org/10.1145/3188745.3188970, , :
Robust moment estimation and improved clustering via sum of squares. STOC : 1035-1046]]>https://dblp.org/rec/conf/stoc/KothariSS18Mon, 01 Jan 2018 00:00:00 +0100 Sum-of-squares meets nash: lower bounds for finding any equilibrium.https://doi.org/10.1145/3188745.3188892, :
Sum-of-squares meets nash: lower bounds for finding any equilibrium. STOC : 1241-1248]]>https://dblp.org/rec/conf/stoc/KothariM18Mon, 01 Jan 2018 00:00:00 +0100 Surprise in Elections.http://arxiv.org/abs/1801.10110, , :
Surprise in Elections. CoRR abs/1801.10110 ()]]>https://dblp.org/rec/journals/corr/abs-1801-10110Mon, 01 Jan 2018 00:00:00 +0100 An Analysis of the t-SNE Algorithm for Data Visualization.http://arxiv.org/abs/1803.01768, , :
An Analysis of the t-SNE Algorithm for Data Visualization. CoRR abs/1803.01768 ()]]>https://dblp.org/rec/journals/corr/abs-1803-01768Mon, 01 Jan 2018 00:00:00 +0100 Efficient Algorithms for Outlier-Robust Regression.http://arxiv.org/abs/1803.03241, , :
Efficient Algorithms for Outlier-Robust Regression. CoRR abs/1803.03241 ()]]>https://dblp.org/rec/journals/corr/abs-1803-03241Mon, 01 Jan 2018 00:00:00 +0100 Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture.http://arxiv.org/abs/1804.08662, , :
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. CoRR abs/1804.08662 ()]]>https://dblp.org/rec/journals/corr/abs-1804-08662Mon, 01 Jan 2018 00:00:00 +0100 Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium.http://arxiv.org/abs/1806.09426, :
Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium. CoRR abs/1806.09426 ()]]>https://dblp.org/rec/journals/corr/abs-1806-09426Mon, 01 Jan 2018 00:00:00 +0100 SOS lower bounds with hard constraints: think global, act local.http://arxiv.org/abs/1809.01207, , :
SOS lower bounds with hard constraints: think global, act local. CoRR abs/1809.01207 ()]]>https://dblp.org/rec/journals/corr/abs-1809-01207Mon, 01 Jan 2018 00:00:00 +0100 Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture.https://eccc.weizmann.ac.il/report/2018/077, , :
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. Electron. Colloquium Comput. Complex. TR18 ()]]>https://dblp.org/rec/journals/eccc/BarakKS18Mon, 01 Jan 2018 00:00:00 +0100 Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium.https://eccc.weizmann.ac.il/report/2018/126, :
Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium. Electron. Colloquium Comput. Complex. TR18 ()]]>https://dblp.org/rec/journals/eccc/KothariM18Mon, 01 Jan 2018 00:00:00 +0100 Sum-of-Squares Meets Program Obfuscation, Revisited.https://eprint.iacr.org/2018/1237, , , , :
Sum-of-Squares Meets Program Obfuscation, Revisited. IACR Cryptol. ePrint Arch. 2018: 1237 ()]]>https://dblp.org/rec/journals/iacr/BarakHJKS18Mon, 01 Jan 2018 00:00:00 +0100 Tight Bounds on ℓ1 Approximation and Learning of Self-Bounding Functions.http://proceedings.mlr.press/v76/feldman17a.html, , :
Tight Bounds on ℓ1 Approximation and Learning of Self-Bounding Functions. ALT : 540-559]]>https://dblp.org/rec/conf/alt/FeldmanKV17Sun, 01 Jan 2017 00:00:00 +0100 The Power of Sum-of-Squares for Detecting Hidden Structures.https://doi.org/10.1109/FOCS.2017.72, , , , , :
The Power of Sum-of-Squares for Detecting Hidden Structures. FOCS : 720-731]]>https://dblp.org/rec/conf/focs/HopkinsKPRSS17Sun, 01 Jan 2017 00:00:00 +0100 Sum of squares lower bounds for refuting any CSP.https://doi.org/10.1145/3055399.3055485, , , :
Sum of squares lower bounds for refuting any CSP. STOC : 132-145]]>https://dblp.org/rec/conf/stoc/KothariMOW17Sun, 01 Jan 2017 00:00:00 +0100 Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs.https://doi.org/10.1145/3055399.3055438, , :
Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs. STOC : 590-603]]>https://dblp.org/rec/conf/stoc/KothariMR17Sun, 01 Jan 2017 00:00:00 +0100 Quantum entanglement, sum of squares, and the log rank conjecture.https://doi.org/10.1145/3055399.3055488, , :
Quantum entanglement, sum of squares, and the log rank conjecture. STOC : 975-988]]>https://dblp.org/rec/conf/stoc/BarakKS17Sun, 01 Jan 2017 00:00:00 +0100 Sum of squares lower bounds for refuting any CSP.http://arxiv.org/abs/1701.04521, , , :
Sum of squares lower bounds for refuting any CSP. CoRR abs/1701.04521 ()]]>https://dblp.org/rec/journals/corr/KothariMOW17Sun, 01 Jan 2017 00:00:00 +0100 Quantum entanglement, sum of squares, and the log rank conjecture.http://arxiv.org/abs/1701.06321, , :
Quantum entanglement, sum of squares, and the log rank conjecture. CoRR abs/1701.06321 ()]]>https://dblp.org/rec/journals/corr/BarakKS17Sun, 01 Jan 2017 00:00:00 +0100 Learning by Refuting.http://arxiv.org/abs/1709.03871, :
Learning by Refuting. CoRR abs/1709.03871 ()]]>https://dblp.org/rec/journals/corr/abs-1709-03871Sun, 01 Jan 2017 00:00:00 +0100 The power of sum-of-squares for detecting hidden structures.http://arxiv.org/abs/1710.05017, , , , , :
The power of sum-of-squares for detecting hidden structures. CoRR abs/1710.05017 ()]]>https://dblp.org/rec/journals/corr/abs-1710-05017Sun, 01 Jan 2017 00:00:00 +0100 Better Agnostic Clustering Via Relaxed Tensor Norms.http://arxiv.org/abs/1711.07465, :
Better Agnostic Clustering Via Relaxed Tensor Norms. CoRR abs/1711.07465 ()]]>https://dblp.org/rec/journals/corr/abs-1711-07465Sun, 01 Jan 2017 00:00:00 +0100 Outlier-robust moment-estimation via sum-of-squares.http://arxiv.org/abs/1711.11581, :
Outlier-robust moment-estimation via sum-of-squares. CoRR abs/1711.11581 ()]]>https://dblp.org/rec/journals/corr/abs-1711-11581Sun, 01 Jan 2017 00:00:00 +0100 Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation).https://eccc.weizmann.ac.il/report/2017/060, , , :
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). Electron. Colloquium Comput. Complex. TR17 ()]]>https://dblp.org/rec/journals/eccc/BarakBKK17Sun, 01 Jan 2017 00:00:00 +0100 Quantum entanglement, sum of squares, and the log rank conjecture.https://eccc.weizmann.ac.il/report/2017/011, , :
Quantum entanglement, sum of squares, and the log rank conjecture. Electron. Colloquium Comput. Complex. TR17 ()]]>https://dblp.org/rec/journals/eccc/BarakKS17Sun, 01 Jan 2017 00:00:00 +0100 Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation).http://eprint.iacr.org/2017/312, , , :
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). IACR Cryptol. ePrint Arch. 2017: 312 ()]]>https://dblp.org/rec/journals/iacr/BarakBKK17Sun, 01 Jan 2017 00:00:00 +0100 A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.https://doi.org/10.1109/FOCS.2016.53, , , , , :
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. FOCS : 428-437]]>https://dblp.org/rec/conf/focs/BarakHKKMP16Fri, 01 Jan 2016 00:00:00 +0100 On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique.https://doi.org/10.1137/1.9781611974331.ch76, , , , :
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. SODA : 1079-1095]]>https://dblp.org/rec/conf/soda/HopkinsKPRS16Fri, 01 Jan 2016 00:00:00 +0100 Communication with Contextual Uncertainty.https://doi.org/10.1137/1.9781611974331.ch144, , , :
Communication with Contextual Uncertainty. SODA : 2072-2085]]>https://dblp.org/rec/conf/soda/GhaziKKS16Fri, 01 Jan 2016 00:00:00 +0100 A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.http://arxiv.org/abs/1604.03084, , , , , :
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. CoRR abs/1604.03084 ()]]>https://dblp.org/rec/journals/corr/BarakHKKMP16Fri, 01 Jan 2016 00:00:00 +0100 Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs.http://arxiv.org/abs/1610.02704, , :
Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs. CoRR abs/1610.02704 ()]]>https://dblp.org/rec/journals/corr/KothariMR16Fri, 01 Jan 2016 00:00:00 +0100 A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.https://eccc.weizmann.ac.il/report/2016/058, , , , , :
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. Electron. Colloquium Comput. Complex. TR16 ()]]>https://dblp.org/rec/journals/eccc/BarakHKKMP16Fri, 01 Jan 2016 00:00:00 +0100 Agnostic learning of disjunctions on symmetric distributions.https://dl.acm.org/doi/10.5555/2789272.2912108, :
Agnostic learning of disjunctions on symmetric distributions. J. Mach. Learn. Res. 16: 3455-3467 ()]]>https://dblp.org/rec/journals/jmlr/FeldmanK15Thu, 01 Jan 2015 00:00:00 +0100 Sum of Squares Lower Bounds from Pairwise Independence.https://doi.org/10.1145/2746539.2746625, , :
Sum of Squares Lower Bounds from Pairwise Independence. STOC : 97-106]]>https://dblp.org/rec/conf/stoc/BarakCK15Thu, 01 Jan 2015 00:00:00 +0100 Almost Optimal Pseudorandom Generators for Spherical Caps: Extended Abstract.https://doi.org/10.1145/2746539.2746611, :
Almost Optimal Pseudorandom Generators for Spherical Caps: Extended Abstract. STOC : 247-256]]>https://dblp.org/rec/conf/stoc/KothariM15Thu, 01 Jan 2015 00:00:00 +0100 Sum of Squares Lower Bounds from Pairwise Independence.http://arxiv.org/abs/1501.00734, , :
Sum of Squares Lower Bounds from Pairwise Independence. CoRR abs/1501.00734 ()]]>https://dblp.org/rec/journals/corr/BarakCK15Thu, 01 Jan 2015 00:00:00 +0100 Communication with Contextual Uncertainty.http://arxiv.org/abs/1504.04813, , :
Communication with Contextual Uncertainty. CoRR abs/1504.04813 ()]]>https://dblp.org/rec/journals/corr/KomargodskiKS15Thu, 01 Jan 2015 00:00:00 +0100 SoS and Planted Clique: Tight Analysis of MPW Moments at all Degrees and an Optimal Lower Bound at Degree Four.http://arxiv.org/abs/1507.05230, , :
SoS and Planted Clique: Tight Analysis of MPW Moments at all Degrees and an Optimal Lower Bound at Degree Four. CoRR abs/1507.05230 ()]]>https://dblp.org/rec/journals/corr/HopkinsKP15Thu, 01 Jan 2015 00:00:00 +0100 Communication with Contextual Uncertainty.https://eccc.weizmann.ac.il/report/2015/064, , :
Communication with Contextual Uncertainty. Electron. Colloquium Comput. Complex. TR15 ()]]>https://dblp.org/rec/journals/eccc/KomargodskiKS15Thu, 01 Jan 2015 00:00:00 +0100 Embedding Hard Learning Problems Into Gaussian Space.https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.793, :
Embedding Hard Learning Problems Into Gaussian Space. APPROX-RANDOM : 793-809]]>https://dblp.org/rec/conf/approx/KlivansK14Wed, 01 Jan 2014 00:00:00 +0100 Learning Coverage Functions and Private Release of Marginals.http://proceedings.mlr.press/v35/feldman14a.html, :
Learning Coverage Functions and Private Release of Marginals. COLT : 679-702]]>https://dblp.org/rec/conf/colt/FeldmanK14Wed, 01 Jan 2014 00:00:00 +0100 Provable Submodular Minimization using Wolfe's Algorithm.https://proceedings.neurips.cc/paper/2014/hash/7bcdf75ad237b8e02e301f4091fb6bc8-Abstract.html, , :
Provable Submodular Minimization using Wolfe's Algorithm. NIPS : 802-809]]>https://dblp.org/rec/conf/nips/Chakrabarty0K14Wed, 01 Jan 2014 00:00:00 +0100 Testing Surface Area.https://doi.org/10.1137/1.9781611973402.89, , , :
Testing Surface Area. SODA : 1204-1214]]>https://dblp.org/rec/conf/soda/KothariNOW14Wed, 01 Jan 2014 00:00:00 +0100 Nearly Tight Bounds on ℓ1 Approximation of Self-Bounding Functions.http://arxiv.org/abs/1404.4702, , :
Nearly Tight Bounds on ℓ1 Approximation of Self-Bounding Functions. CoRR abs/1404.4702 ()]]>https://dblp.org/rec/journals/corr/FeldmanKV14Wed, 01 Jan 2014 00:00:00 +0100 Agnostic Learning of Disjunctions on Symmetric Distributions.http://arxiv.org/abs/1405.6791, :
Agnostic Learning of Disjunctions on Symmetric Distributions. CoRR abs/1405.6791 ()]]>https://dblp.org/rec/journals/corr/FeldmanK14Wed, 01 Jan 2014 00:00:00 +0100 Provable Submodular Minimization using Wolfe's Algorithm.http://arxiv.org/abs/1411.0095, , :
Provable Submodular Minimization using Wolfe's Algorithm. CoRR abs/1411.0095 ()]]>https://dblp.org/rec/journals/corr/Chakrabarty0K14Wed, 01 Jan 2014 00:00:00 +0100 Almost Optimal Pseudorandom Generators for Spherical Caps.http://arxiv.org/abs/1411.6299, :
Almost Optimal Pseudorandom Generators for Spherical Caps. CoRR abs/1411.6299 ()]]>https://dblp.org/rec/journals/corr/KothariM14Wed, 01 Jan 2014 00:00:00 +0100 Embedding Hard Learning Problems into Gaussian Space.https://eccc.weizmann.ac.il/report/2014/063, :
Embedding Hard Learning Problems into Gaussian Space. Electron. Colloquium Comput. Complex. TR14 ()]]>https://dblp.org/rec/journals/eccc/KlivansK14Wed, 01 Jan 2014 00:00:00 +0100 Constructing Hard Functions Using Learning Algorithms.https://doi.org/10.1109/CCC.2013.18, , :
Constructing Hard Functions Using Learning Algorithms. CCC : 86-97]]>https://dblp.org/rec/conf/coco/KlivansKO13Tue, 01 Jan 2013 00:00:00 +0100 Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees.http://proceedings.mlr.press/v30/Feldman13.html, , :
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees. COLT : 711-740]]>https://dblp.org/rec/conf/colt/FeldmanKV13Tue, 01 Jan 2013 00:00:00 +0100 Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees.http://arxiv.org/abs/1304.0730, , :
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees. CoRR abs/1304.0730 ()]]>https://dblp.org/rec/journals/corr/abs-1304-0730Tue, 01 Jan 2013 00:00:00 +0100 Learning Coverage Functions.http://arxiv.org/abs/1304.2079, :
Learning Coverage Functions. CoRR abs/1304.2079 ()]]>https://dblp.org/rec/journals/corr/abs-1304-2079Tue, 01 Jan 2013 00:00:00 +0100 Constructing Hard Functions from Learning Algorithms.https://eccc.weizmann.ac.il/report/2013/129, , :
Constructing Hard Functions from Learning Algorithms. Electron. Colloquium Comput. Complex. TR13 ()]]>https://dblp.org/rec/journals/eccc/KlivansKO13Tue, 01 Jan 2013 00:00:00 +0100 An Explicit VC-Theorem for Low-Degree Polynomials.https://doi.org/10.1007/978-3-642-32512-0_42, , :
An Explicit VC-Theorem for Low-Degree Polynomials. APPROX-RANDOM : 495-504]]>https://dblp.org/rec/conf/approx/ChattopadhyayKK12Sun, 01 Jan 2012 00:00:00 +0100 Submodular functions are noise stable.https://doi.org/10.1137/1.9781611973099.126, , , :
Submodular functions are noise stable. SODA : 1586-1592]]>https://dblp.org/rec/conf/soda/CheraghchiKKL12Sun, 01 Jan 2012 00:00:00 +0100 Differentially Private Online Learning.http://proceedings.mlr.press/v23/jain12/jain12.pdf, , :
Differentially Private Online Learning. COLT : 24.1-24.34]]>https://dblp.org/rec/journals/jmlr/JainKT12Sun, 01 Jan 2012 00:00:00 +0100 An Explicit VC-Theorem for Low-Degree Polynomials.https://eccc.weizmann.ac.il/report/2012/127, , :
An Explicit VC-Theorem for Low-Degree Polynomials. Electron. Colloquium Comput. Complex. TR12 ()]]>https://dblp.org/rec/journals/eccc/ChattopadhyayKK12Sun, 01 Jan 2012 00:00:00 +0100 Submodular Functions Are Noise Stable.http://arxiv.org/abs/1106.0518, , , :
Submodular Functions Are Noise Stable. CoRR abs/1106.0518 ()]]>https://dblp.org/rec/journals/corr/abs-1106-0518Sat, 01 Jan 2011 00:00:00 +0100 Differentially Private Online Learning.http://arxiv.org/abs/1109.0105, , :
Differentially Private Online Learning. CoRR abs/1109.0105 ()]]>https://dblp.org/rec/journals/corr/abs-1109-0105Sat, 01 Jan 2011 00:00:00 +0100 Submodular Functions Are Noise Stable.https://eccc.weizmann.ac.il/report/2011/090, , , :
Submodular Functions Are Noise Stable. Electron. Colloquium Comput. Complex. TR11 ()]]>https://dblp.org/rec/journals/eccc/CheraghchiKKL11Sat, 01 Jan 2011 00:00:00 +0100 A randomized scheduler with probabilistic guarantees of finding bugs.https://doi.org/10.1145/1736020.1736040, , , :
A randomized scheduler with probabilistic guarantees of finding bugs. ASPLOS : 167-178]]>https://dblp.org/rec/conf/asplos/BurckhardtKMN10Fri, 01 Jan 2010 00:00:00 +0100