Остановите войну!
for scientists:
default search action
Yishay Mansour
- > Home > Persons > Yishay Mansour
Publications
- 2024
- [i140]Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning-Augmented Algorithms with Explicit Predictors. CoRR abs/2403.07413 (2024) - 2023
- [c284]Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Concurrent Shuffle Differential Privacy Under Continual Observation. ICML 2023: 33961-33982 - [c281]Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer:
Black-Box Differential Privacy for Interactive ML. NeurIPS 2023 - [i139]Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Concurrent Shuffle Differential Privacy Under Continual Observation. CoRR abs/2301.12535 (2023) - [i134]Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer:
On Differentially Private Online Predictions. CoRR abs/2302.14099 (2023) - 2022
- [j110]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Adversarially Robust Streaming Algorithms via Differential Privacy. J. ACM 69(6): 42:1-42:14 (2022) - [j107]Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Differentially Private Learning of Geometric Concepts. SIAM J. Comput. 51(4): 952-974 (2022) - [c277]Olivier Bousquet, Amit Daniely, Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer:
Monotone Learning. COLT 2022: 842-866 - [c273]Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer:
FriendlyCore: Practical Differentially Private Aggregation. ICML 2022: 21828-21863 - [c268]Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer:
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. STOC 2022: 1671-1684 - [i124]Olivier Bousquet, Amit Daniely, Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer:
Monotone Learning. CoRR abs/2202.05246 (2022) - [i109]Olivier Bousquet, Haim Kaplan, Aryeh Kontorovich, Yishay Mansour, Shay Moran, Menachem Sadigurschi, Uri Stemmer:
Differentially-Private Bayes Consistency. CoRR abs/2212.04216 (2022) - 2021
- [c266]Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour:
Online Markov Decision Processes with Aggregate Bandit Feedback. COLT 2021: 1301-1329 - [c265]Haim Kaplan, Yishay Mansour, Uri Stemmer:
The Sparse Vector Technique, Revisited. COLT 2021: 2747-2776 - [c264]Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer:
Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model. CRYPTO (3) 2021: 94-121 - [c263]Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Differentially-Private Clustering of Easy Instances. ICML 2021: 2049-2059 - [c253]Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Differentially Private Multi-Armed Bandits in the Shuffle Model. NeurIPS 2021: 24956-24967 - [i108]Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer:
Separating Adaptive Streaming from Oblivious Streaming. CoRR abs/2101.10836 (2021) - [i107]Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour:
Online Markov Decision Processes with Aggregate Bandit Feedback. CoRR abs/2102.00490 (2021) - [i103]Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Differentially Private Multi-Armed Bandits in the Shuffle Model. CoRR abs/2106.02900 (2021) - [i99]Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer:
FriendlyCore: Practical Differentially Private Aggregation. CoRR abs/2110.10132 (2021) - [i98]Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer:
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR abs/2111.03980 (2021) - [i96]Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Differentially-Private Clustering of Easy Instances. CoRR abs/2112.14445 (2021) - 2020
- [c250]Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour:
Apprenticeship Learning via Frank-Wolfe. AAAI 2020: 6720-6728 - [c249]Yuval Lewi, Haim Kaplan, Yishay Mansour:
Thompson Sampling for Adversarial Bit Prediction. ALT 2020: 518-553 - [c247]Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour:
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. ALT 2020: 906-934 - [c246]Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer:
Privately Learning Thresholds: Closing the Exponential Gap. COLT 2020: 2263-2285 - [c244]Aviv Rosenberg, Alon Cohen, Yishay Mansour, Haim Kaplan:
Near-optimal Regret Bounds for Stochastic Shortest Path. ICML 2020: 8210-8219 - [c240]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Adversarially Robust Streaming Algorithms via Differential Privacy. NeurIPS 2020 - [c239]Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. NeurIPS 2020 - [c237]Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour:
Unknown mixing times in apprenticeship and reinforcement learning. UAI 2020: 430-439 - [i95]Alon Cohen, Haim Kaplan, Yishay Mansour, Aviv Rosenberg:
Near-optimal Regret Bounds for Stochastic Shortest Path. CoRR abs/2002.09869 (2020) - [i92]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Adversarially Robust Streaming Algorithms via Differential Privacy. CoRR abs/2004.05975 (2020) - [i91]Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. CoRR abs/2004.07839 (2020) - [i82]Haim Kaplan, Yishay Mansour, Uri Stemmer:
The Sparse Vector Technique, Revisited. CoRR abs/2010.00917 (2020) - 2019
- [c232]Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Differentially Private Learning of Geometric Concepts. ICML 2019: 3233-3241 - [c226]Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning to Screen. NeurIPS 2019: 8612-8621 - [i78]Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning and Generalization for Matching Problems. CoRR abs/1902.04741 (2019) - [i77]Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Differentially Private Learning of Geometric Concepts. CoRR abs/1902.05017 (2019) - [i75]Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour:
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. CoRR abs/1902.10140 (2019) - [i72]Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour:
Average reward reinforcement learning with unknown mixing times. CoRR abs/1905.09704 (2019) - [i67]Yuval Lewi, Haim Kaplan, Yishay Mansour:
Thompson Sampling for Adversarial Bit Prediction. CoRR abs/1906.09059 (2019) - [i63]Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour:
Apprenticeship Learning via Frank-Wolfe. CoRR abs/1911.01679 (2019) - [i62]Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer:
Privately Learning Thresholds: Closing the Exponential Gap. CoRR abs/1911.10137 (2019) - 2018
- [i60]Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour:
Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies. CoRR abs/1803.04674 (2018) - 2017
- [j99]Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov:
Upward Max-Min Fairness. J. ACM 64(1): 2:1-2:24 (2017) - 2016
- [j93]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR Game. ACM Trans. Economics and Comput. 5(1): 1:1-1:22 (2016) - 2014
- [j89]Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur:
Probe scheduling for efficient detection of silent failures. Perform. Evaluation 79: 73-89 (2014) - 2013
- [c183]Edith Cohen, Haim Kaplan, Yishay Mansour:
Scheduling Subset Tests: One-Time, Continuous, and How They Relate. APPROX-RANDOM 2013: 81-95 - [i21]Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur:
Probe Scheduling for Efficient Detection of Silent Failures. CoRR abs/1302.0792 (2013) - 2012
- [c169]Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov:
Upward Max Min Fairness. INFOCOM 2012: 837-845 - [c165]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR Game: Equilibrium Characterization - (Working Paper). WINE 2012: 561 - [i9]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR game: Equilibrium Characterization (Working Paper). CoRR abs/1210.1757 (2012) - 2011
- [c158]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
Non-price equilibria in markets of discrete goods. EC 2011: 295-296 - [i8]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
Non-Price Equilibria in Markets of Discrete Goods. CoRR abs/1103.3950 (2011) - 2005
- [c110]Haim Kaplan, Eyal Kushilevitz, Yishay Mansour:
Learning with attribute costs. STOC 2005: 356-365 - 2003
- [j50]Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour:
Predicting and bypassing end-to-end Internet service degradations. IEEE J. Sel. Areas Commun. 21(6): 961-978 (2003) - 2002
- [c89]Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour:
Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop 2002: 307-320
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-04-07 22:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint