ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1602.05161
  4. Cited By
Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity
  Learning

Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning

16 February 2016
R. Raz
ArXivPDFHTML

Papers citing "Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning"

18 / 18 papers shown
Title
Auto-Regressive Next-Token Predictors are Universal Learners
Auto-Regressive Next-Token Predictors are Universal Learners
Eran Malach
LRM
24
36
0
13 Sep 2023
Memory-Query Tradeoffs for Randomized Convex Optimization
Memory-Query Tradeoffs for Randomized Convex Optimization
Xinyu Chen
Binghui Peng
36
6
0
21 Jun 2023
A survey on the complexity of learning quantum states
A survey on the complexity of learning quantum states
Anurag Anshu
Srinivasan Arunachalam
34
66
0
31 May 2023
Near Optimal Memory-Regret Tradeoff for Online Learning
Near Optimal Memory-Regret Tradeoff for Online Learning
Binghui Peng
A. Rubinstein
CLL
34
10
0
03 Mar 2023
On Differential Privacy and Adaptive Data Analysis with Bounded Space
On Differential Privacy and Adaptive Data Analysis with Bounded Space
Itai Dinur
Uri Stemmer
David P. Woodruff
Samson Zhou
24
12
0
11 Feb 2023
Powerful Primitives in the Bounded Quantum Storage Model
Powerful Primitives in the Bounded Quantum Storage Model
Mohammed Barhoush
L. Salvail
14
4
0
11 Feb 2023
Online Prediction in Sub-linear Space
Online Prediction in Sub-linear Space
Binghui Peng
Fred Zhang
23
16
0
16 Jul 2022
Impartial Games: A Challenge for Reinforcement Learning
Impartial Games: A Challenge for Reinforcement Learning
Bei Zhou
Søren Riis
32
6
0
25 May 2022
Estimation of Entropy in Constant Space with Improved Sample Complexity
Estimation of Entropy in Constant Space with Improved Sample Complexity
Maryam Aliakbarpour
A. Mcgregor
Jelani Nelson
Erik Waingarten
23
8
0
19 May 2022
Memory Bounds for Continual Learning
Memory Bounds for Continual Learning
Xi Chen
Christos H. Papadimitriou
Binghui Peng
CLL
LRM
29
22
0
22 Apr 2022
Efficient Convex Optimization Requires Superlinear Memory
Efficient Convex Optimization Requires Superlinear Memory
A. Marsden
Vatsal Sharan
Aaron Sidford
Gregory Valiant
29
14
0
29 Mar 2022
Exponential separations between learning with and without quantum memory
Exponential separations between learning with and without quantum memory
Sitan Chen
Jordan S. Cotler
Hsin-Yuan Huang
Jingkai Li
42
109
0
10 Nov 2021
Can Shallow Neural Networks Beat the Curse of Dimensionality? A mean
  field training perspective
Can Shallow Neural Networks Beat the Curse of Dimensionality? A mean field training perspective
Stephan Wojtowytsch
E. Weinan
MLT
26
48
0
21 May 2020
Memory-Sample Tradeoffs for Linear Regression with Small Error
Memory-Sample Tradeoffs for Linear Regression with Small Error
Vatsal Sharan
Aaron Sidford
Gregory Valiant
17
35
0
18 Apr 2019
Distributed Learning with Sublinear Communication
Distributed Learning with Sublinear Communication
Jayadev Acharya
Christopher De Sa
Dylan J. Foster
Karthik Sridharan
FedML
21
40
0
28 Feb 2019
Lower Bound On the Computational Complexity of Discounted Markov
  Decision Problems
Lower Bound On the Computational Complexity of Discounted Markov Decision Problems
Yichen Chen
Mengdi Wang
14
17
0
20 May 2017
Mixing Complexity and its Applications to Neural Networks
Mixing Complexity and its Applications to Neural Networks
Michal Moshkovitz
Naftali Tishby
21
11
0
02 Mar 2017
Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related
  Problems
Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems
N. Bansal
S. Garg
Jesper Nederlof
Nikhil Vyas
17
19
0
08 Dec 2016
1