default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUmar Syed
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Jacob D. Abernethy, Robert E. Schapire, Umar Syed:
Lexicographic Optimization: Algorithms and Stability. AISTATS 2024: 2503-2511- [c31]William Kong, Andrés Muñoz Medina, Mónica Ribero, Umar Syed:
DP-Auditorium: A Large-Scale Library for Auditing Differential Privacy. SP 2024: 110-126 - [c30]Enrico Bacis
, Igor Bilogrevic, Róbert Busa-Fekete, Asanka Herath, Antonio Sartori, Umar Syed:
Assessing Web Fingerprinting Risk. WWW (Companion Volume) 2024: 245-254 - [i13]Enrico Bacis, Igor Bilogrevic, Róbert Busa-Fekete, Asanka Herath, Antonio Sartori, Umar Syed:
Assessing Web Fingerprinting Risk. CoRR abs/2403.15607 (2024) - [i12]Kareem Amin, Alex Bie, Weiwei Kong, Alexey Kurakin, Natalia Ponomareva, Umar Syed, Andreas Terzis, Sergei Vassilvitskii:
Private prediction for large-scale synthetic text generation. CoRR abs/2407.12108 (2024) - 2023
- [c29]Róbert Istvan Busa-Fekete, Andrés Muñoz Medina, Umar Syed, Sergei Vassilvitskii:
Label differential privacy and private training data release. ICML 2023: 3233-3251 - [i11]Gecia Bravo Hermsdorff, Róbert Busa-Fekete, Mohammad Ghavamzadeh, Andres Muñoz Medina, Umar Syed:
Private and Communication-Efficient Algorithms for Entropy Estimation. CoRR abs/2305.07751 (2023) - [i10]Alexey Kurakin, Natalia Ponomareva, Umar Syed, Liam MacDermed, Andreas Terzis:
Harnessing large-language models to generate private synthetic text. CoRR abs/2306.01684 (2023) - 2022
- [c28]Hossein Esfandiari, Vahab S. Mirrokni, Umar Syed, Sergei Vassilvitskii:
Label differential privacy via clustering. AISTATS 2022: 7055-7075 - [c27]Gecia Bravo Hermsdorff, Róbert Busa-Fekete, Mohammad Ghavamzadeh, Andrés Muñoz Medina, Umar Syed:
Private and Communication-Efficient Algorithms for Entropy Estimation. NeurIPS 2022 - [i9]Gecia Bravo Hermsdorff, Róbert Busa-Fekete, Lee M. Gunderson, Andrés Muñoz Medina, Umar Syed:
Statistical anonymity: Quantifying reidentification risks without reidentifying users. CoRR abs/2201.12306 (2022) - 2021
- [c26]Andrés Muñoz Medina, Umar Syed, Sergei Vassilvitskii, Ellen Vitercik:
Private optimization without constraint violations. AISTATS 2021: 2557-2565 - [c25]Alessandro Epasto, Andrés Muñoz Medina, Steven Avery, Yijian Bai, Róbert Busa-Fekete, CJ Carey, Ya Gao, David Guthrie, Subham Ghosh, James Ioannidis, Junyi Jiao, Jakub Lacki, Jason Lee, Arne Mauser, Brian Milch, Vahab S. Mirrokni, Deepak Ravichandran, Wei Shi, Max Spero, Yunting Sun, Umar Syed, Sergei Vassilvitskii, Shuo Wang:
Clustering for Private Interest-based Advertising. KDD 2021: 2802-2810 - [i8]Hossein Esfandiari, Vahab S. Mirrokni, Umar Syed, Sergei Vassilvitskii:
Label differential privacy via clustering. CoRR abs/2110.02159 (2021) - 2020
- [i7]Andrés Muñoz Medina, Umar Syed, Sergei Vassilvitskii, Ellen Vitercik:
Private Optimization Without Constraint Violations. CoRR abs/2007.01181 (2020)
2010 – 2019
- 2018
- [j1]Umar Syed:
Inmate OS and VMM based Secured Virtualization for Cloud Encompassment. Int. J. Web Appl. 10(1): 1-7 (2018) - 2017
- [c24]Umar Syed, Sergei Vassilvitskii:
SQML: large-scale in-database machine learning with pure SQL. SoCC 2017: 659 - [c23]Eric Balkanski, Umar Syed, Sergei Vassilvitskii:
Statistical Cost Sharing. NIPS 2017: 6221-6230 - [i6]Eric Balkanski, Umar Syed, Sergei Vassilvitskii:
Statistical Cost Sharing. CoRR abs/1703.03111 (2017) - 2016
- [c22]Hoda Heidari, Mohammad Mahdian, Umar Syed, Sergei Vassilvitskii, Sadra Yazdanbod:
Pricing a Low-regret Seller. ICML 2016: 2559-2567 - [c21]Hamid Nazerzadeh, Renato Paes Leme, Afshin Rostamizadeh, Umar Syed:
Where to Sell: Simulating Auctions From Learning Algorithms. EC 2016: 597-598 - 2015
- [c20]Giulia DeSalvo, Mehryar Mohri, Umar Syed:
Learning with Deep Cascades. ALT 2015: 254-269 - [c19]Krzysztof Marcin Choromanski, Afshin Rostamizadeh, Umar Syed:
An Optimal Online Algorithm For Retrieving Heavily Perturbed Statistical Databases In The Low-Dimensional Querying Model. CIKM 2015: 1381-1390 - [c18]Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, Umar Syed:
Structural Maxent Models. ICML 2015: 391-399 - [i5]Krzysztof Choromanski, Afshin Rostamizadeh, Umar Syed:
An $\tilde{O}(\frac{1}{\sqrt{T}})$-error online algorithm for retrieving heavily perturbated statistical databases in the low-dimensional querying mode. CoRR abs/1504.01117 (2015) - 2014
- [c17]Corinna Cortes, Mehryar Mohri, Umar Syed:
Deep Boosting. ICML 2014: 1179-1187 - [c16]Arthur Asuncion, Jac de Haan, Mehryar Mohri, Kayur Patel, Afshin Rostamizadeh, Umar Syed, Lauren Wong:
Corporate learning at scale: lessons from a large online course at google. L@S 2014: 187-188 - [c15]Kareem Amin, Afshin Rostamizadeh, Umar Syed:
Repeated Contextual Auctions with Strategic Buyers. NIPS 2014: 622-630 - [c14]Vitaly Kuznetsov, Mehryar Mohri, Umar Syed:
Multi-Class Deep Boosting. NIPS 2014: 2501-2509 - 2013
- [c13]Kareem Amin, Afshin Rostamizadeh, Umar Syed:
Learning Prices for Repeated Auctions with Strategic Buyers. NIPS 2013: 1169-1177 - [i4]Kareem Amin, Afshin Rostamizadeh, Umar Syed:
Learning Prices for Repeated Auctions with Strategic Buyers. CoRR abs/1311.6838 (2013) - 2012
- [i3]Kareem Amin, Michael J. Kearns, Umar Syed:
Graphical Models for Bandit Problems. CoRR abs/1202.3782 (2012) - [i2]Umar Syed, Robert E. Schapire:
Imitation Learning with a Value-Based Prior. CoRR abs/1206.5290 (2012) - 2011
- [c12]Alex Fabrikant, Umar Syed, Jennifer Rexford:
There's something about MRAI: Timing diversity can exponentially worsen BGP convergence. INFOCOM 2011: 2975-2983 - [c11]Kareem Amin, Michael J. Kearns, Umar Syed:
Graphical Models for Bandit Problems. UAI 2011: 1-10 - [c10]Kareem Amin, Michael J. Kearns, Umar Syed:
Bandits, Query Learning, and the Haystack Dimension. COLT 2011: 87-106 - 2010
- [c9]Mickey Brautbar, Michael J. Kearns, Umar Syed:
Private and Third-Party Randomization in Risk-Sensitive Equilibrium Concepts. AAAI 2010: 723-728 - [c8]Umar Syed, Ben Taskar:
Semi-Supervised Learning with Adversarially Missing Label Information. NIPS 2010: 2244-2252 - [c7]Umar Syed, Robert E. Schapire:
A Reduction from Apprenticeship Learning to Classification. NIPS 2010: 2253-2261 - [i1]Umar Syed, Aleksandrs Slivkins, Nina Mishra:
Adapting to the Shifting Intent of Search Queries. CoRR abs/1007.3799 (2010)
2000 – 2009
- 2009
- [c6]Umar Syed, Aleksandrs Slivkins, Nina Mishra:
Adapting to the Shifting Intent of Search Queries. NIPS 2009: 1829-1837 - 2008
- [c5]Umar Syed, Jason D. Williams:
Using Automatically Transcribed Dialogs to Learn User Models in a Spoken Dialog System. ACL (2) 2008: 121-124 - [c4]Umar Syed, Michael H. Bowling, Robert E. Schapire:
Apprenticeship learning using linear programming. ICML 2008: 1032-1039 - 2007
- [c3]Umar Syed, Robert E. Schapire:
A Game-Theoretic Approach to Apprenticeship Learning. NIPS 2007: 1449-1456 - [c2]Umar Syed, Robert E. Schapire:
Imitation Learning with a Value-Based Prior. UAI 2007: 384-391 - 2003
- [c1]Umar Syed, Golan Yona:
Using a mixture of probabilistic decision trees for direct prediction of protein function. RECOMB 2003: 289-300
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-09-22 23:37 CEST 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:
