Yuval Dagan

Orcid: 0000-0002-7940-4002

According to our database1, Yuval Dagan authored at least 28 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces.
CoRR, 2023

Ambient Diffusion: Learning Clean Distributions from Corrupted Data.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Learning and Testing Latent-Tree Ising Models Efficiently.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Online Learning and Solving Infinite Games with an ERM Oracle.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Score-Guided Intermediate Layer Optimization: Fast Langevin Mixing for Inverse Problems.
CoRR, 2022

Score-Guided Intermediate Level Optimization: Fast Langevin Mixing for Inverse Problems.
Proceedings of the International Conference on Machine Learning, 2022

EM's Convergence in Gaussian Latent Tree Models.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

A bounded-noise mechanism for differential privacy.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Smoothed Online Learning is as Easy as Statistical Learning.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Interaction is Necessary for Distributed Learning with Privacy or Communication Constraints.
J. Priv. Confidentiality, 2021

Learning Ising models from one or multiple samples.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Adversarial laws of large numbers and optimal regret in online classification.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

The Entropy of Lies: Playing Twenty Questions with a Liar.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Statistical Estimation from Dependent Data.
Proceedings of the 38th International Conference on Machine Learning, 2021

Majorizing Measures, Sequential Complexities, and Online Learning.
Proceedings of the Conference on Learning Theory, 2021

2020
Estimating Ising Models from One Sample.
CoRR, 2020

PAC learning with stable and private predictions.
Proceedings of the Conference on Learning Theory, 2020

2019
The Log-Concave Maximum Likelihood Estimator is Optimal in High Dimensions.
CoRR, 2019

Space lower bounds for linear prediction.
CoRR, 2019

Twenty (Short) Questions.
Comb., 2019

Space lower bounds for linear prediction in the streaming model.
Proceedings of the Conference on Learning Theory, 2019

Learning from Weakly Dependent Data under Dobrushin's Condition.
Proceedings of the Conference on Learning Theory, 2019

2018
Trading Information Complexity for Error.
Theory Comput., 2018

Proactive Rerouting in Network Overlays.
Proceedings of the 17th International IFIP TC6 Networking Conference, 2018

Detecting Correlations with Little Memory and Communication.
Proceedings of the Conference On Learning Theory, 2018

A Better Resource Allocation Algorithm with Semi-Bandit Feedback.
Proceedings of the Algorithmic Learning Theory, 2018

2017
Twenty (simple) questions.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017


  Loading...