default search action
Yuval Dagan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Yuval Dagan
, Constantinos Daskalakis, Maxwell Fishelson
From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces. STOC 2024: 1216-1222 - [i27]Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich, Robert Kleinberg, Princewill Okoroafor:
Improved bounds for calibration via stronger sign preservation games. CoRR abs/2406.13668 (2024) - [i26]Angelos Assos, Yuval Dagan, Constantinos Daskalakis:
Maximizing utility in multi-agent environments by anticipating the behavior of other learners. CoRR abs/2407.04889 (2024) - [i25]Yuval Dagan, Michael I. Jordan, Xuelin Yang, Lydia Zakynthinou, Nikita Zhivotovskiy:
Dimension-free Private Mean Estimation for Anisotropic Distributions. CoRR abs/2411.00775 (2024) - 2023
- [b1]Yuval Dagan:
Statistical Estimation from Dependent and Adversarial Data. MIT, USA, 2023 - [c22]Angelos Assos, Idan Attias, Yuval Dagan, Constantinos Daskalakis, Maxwell K. Fishelson:
Online Learning and Solving Infinite Games with an ERM Oracle. COLT 2023: 274-324 - [c21]Anthimos Vardis Kandiros, Constantinos Daskalakis, Yuval Dagan, Davin Choo:
Learning and Testing Latent-Tree Ising Models Efficiently. COLT 2023: 1666-1729 - [c20]Giannis Daras, Yuval Dagan, Alex Dimakis, Constantinos Daskalakis:
Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent. NeurIPS 2023 - [c19]Giannis Daras, Kulin Shah, Yuval Dagan, Aravind Gollakota, Alex Dimakis, Adam R. Klivans:
Ambient Diffusion: Learning Clean Distributions from Corrupted Data. NeurIPS 2023 - [i24]Giannis Daras, Yuval Dagan, Alexandros G. Dimakis, Constantinos Daskalakis:
Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent. CoRR abs/2302.09057 (2023) - [i23]Giannis Daras, Kulin Shah, Yuval Dagan, Aravind Gollakota, Alexandros G. Dimakis, Adam R. Klivans:
Ambient Diffusion: Learning Clean Distributions from Corrupted Data. CoRR abs/2305.19256 (2023) - [i22]Angelos Assos, Idan Attias, Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson:
Online Learning and Solving Infinite Games with an ERM Oracle. CoRR abs/2307.01689 (2023) - [i21]Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich:
From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces. CoRR abs/2310.19786 (2023) - 2022
- [c18]Yuval Dagan, Gil Kur:
A bounded-noise mechanism for differential privacy. COLT 2022: 625-661 - [c17]Adam Block, Yuval Dagan, Noah Golowich, Alexander Rakhlin:
Smoothed Online Learning is as Easy as Statistical Learning. COLT 2022: 1716-1786 - [c16]Yuval Dagan, Anthimos Vardis Kandiros, Constantinos Daskalakis:
EM's Convergence in Gaussian Latent Tree Models. COLT 2022: 2597-2667 - [c15]Giannis Daras, Yuval Dagan, Alex Dimakis, Constantinos Daskalakis:
Score-Guided Intermediate Level Optimization: Fast Langevin Mixing for Inverse Problems. ICML 2022: 4722-4753 - [i20]Adam Block, Yuval Dagan, Noah Golowich, Alexander Rakhlin:
Smoothed Online Learning is as Easy as Statistical Learning. CoRR abs/2202.04690 (2022) - [i19]Giannis Daras, Yuval Dagan, Alexandros G. Dimakis, Constantinos Daskalakis:
Score-Guided Intermediate Layer Optimization: Fast Langevin Mixing for Inverse Problems. CoRR abs/2206.09104 (2022) - [i18]Yuval Dagan, Constantinos Daskalakis, Anthimos Vardis Kandiros:
EM's Convergence in Gaussian Latent Tree Models. CoRR abs/2211.11904 (2022) - [i17]Davin Choo, Yuval Dagan, Constantinos Daskalakis, Anthimos Vardis Kandiros:
Learning and Testing Latent-Tree Ising Models Efficiently. CoRR abs/2211.13291 (2022) - 2021
- [j3]Yuval Dagan, Vitaly Feldman:
Interaction is Necessary for Distributed Learning with Privacy or Communication Constraints. J. Priv. Confidentiality 11(2) (2021) - [c14]Adam Block, Yuval Dagan, Alexander Rakhlin:
Majorizing Measures, Sequential Complexities, and Online Learning. COLT 2021: 587-590 - [c13]Anthimos Vardis Kandiros, Yuval Dagan, Nishanth Dikkala, Surbhi Goel, Constantinos Daskalakis:
Statistical Estimation from Dependent Data. ICML 2021: 5269-5278 - [c12]Yuval Dagan, Yuval Filmus, Daniel Kane, Shay Moran:
The Entropy of Lies: Playing Twenty Questions with a Liar. ITCS 2021: 1:1-1:16 - [c11]Yuval Dagan
Learning Ising models from one or multiple samples. STOC 2021: 161-168 - [c10]Noga Alon
Adversarial laws of large numbers and optimal regret in online classification. STOC 2021: 447-455 - [i16]Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev:
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification. CoRR abs/2101.09054 (2021) - [i15]Adam Block, Yuval Dagan, Sasha Rakhlin:
Majorizing Measures, Sequential Complexities, and Online Learning. CoRR abs/2102.01729 (2021) - [i14]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Surbhi Goel, Anthimos Vardis Kandiros:
Statistical Estimation from Dependent Data. CoRR abs/2107.09773 (2021) - 2020
- [c9]Yuval Dagan, Vitaly Feldman:
PAC learning with stable and private predictions. COLT 2020: 1389-1410 - [c8]Yuval Dagan
Interaction is necessary for distributed learning with privacy or communication constraints. STOC 2020: 450-462 - [i13]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Anthimos Vardis Kandiros:
Estimating Ising Models from One Sample. CoRR abs/2004.09370 (2020) - [i12]Yuval Dagan, Gil Kur:
A bounded-noise mechanism for differential privacy. CoRR abs/2012.03817 (2020)
2010 – 2019
- 2019
- [j2]Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (Short) Questions. Comb. 39(3): 597-626 (2019) - [c7]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti:
Learning from Weakly Dependent Data under Dobrushin's Condition. COLT 2019: 914-928 - [c6]Yuval Dagan, Gil Kur, Ohad Shamir:
Space lower bounds for linear prediction in the streaming model. COLT 2019: 929-954 - [i11]Yuval Dagan, Gil Kur, Ohad Shamir:
Space lower bounds for linear prediction. CoRR abs/1902.03498 (2019) - [i10]Yuval Dagan, Gil Kur:
The Log-Concave Maximum Likelihood Estimator is Optimal in High Dimensions. CoRR abs/1903.05315 (2019) - [i9]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti:
Learning from weakly dependent data under Dobrushin's condition. CoRR abs/1906.09247 (2019) - [i8]Yuval Dagan, Vitaly Feldman:
Interaction is necessary for distributed learning with privacy or communication constraints. CoRR abs/1911.04014 (2019) - [i7]Yuval Dagan, Vitaly Feldman:
PAC learning with stable and private predictions. CoRR abs/1911.10541 (2019) - 2018
- [j1]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading Information Complexity for Error. Theory Comput. 14(1): 1-73 (2018) - [c5]Yuval Dagan, Koby Crammer:
A Better Resource Allocation Algorithm with Semi-Bandit Feedback. ALT 2018: 268-320 - [c4]Yuval Dagan, Ohad Shamir:
Detecting Correlations with Little Memory and Communication. COLT 2018: 1145-1198 - [c3]Reuven Cohen, Yuval Dagan, Gabi Nakibly:
Proactive Rerouting in Network Overlays. Networking 2018: 163-171 - [i6]Yuval Dagan, Ohad Shamir:
Detecting Correlations with Little Memory and Communication. CoRR abs/1803.01420 (2018) - [i5]Yuval Dagan, Koby Crammer:
A Better Resource Allocation Algorithm with Semi-Bandit Feedback. CoRR abs/1803.10415 (2018) - [i4]Yuval Dagan, Yuval Filmus, Daniel Kane, Shay Moran:
The entropy of lies: playing twenty questions with a liar. CoRR abs/1811.02177 (2018) - 2017
- [c2]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li
Trading Information Complexity for Error. CCC 2017: 16:1-16:59 - [c1]Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (simple) questions. STOC 2017: 9-21 - 2016
- [i3]Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (simple) questions. CoRR abs/1611.01655 (2016) - [i2]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading information complexity for error. CoRR abs/1611.06650 (2016) - [i1]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading information complexity for error. Electron. Colloquium Comput. Complex. TR16 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 20:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: