![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 311 matches
- 2014
- Ping Li, Michael Mitzenmacher, Anshumali Shrivastava:
Coding for Random Projections. ICML 2014: 676-684 - Arpit Agarwal, Harikrishna Narasimhan, Shivaram Kalyanakrishnan, Shivani Agarwal:
GEV-Canonical Regression for Accurate Binary Class Probability Estimation when One Class is Rare. ICML 2014: 1989-1997 - Prateek Jain, Abhradeep Guha Thakurta:
(Near) Dimension Independent Risk Bounds for Differentially Private Learning. ICML 2014: 476-484 - Ji Liu, Jieping Ye, Ryohei Fujimaki:
Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint. ICML 2014: 503-511 - Lijun Zhang, Jinfeng Yi, Rong Jin:
Efficient Algorithms for Robust One-bit Compressive Sensing. ICML 2014: 820-828 - Yasin Abbasi-Yadkori, Peter L. Bartlett, Varun Kanade:
Tracking Adversarial Targets. ICML 2014: 369-377 - Raja Hafiz Affandi, Emily B. Fox, Ryan P. Adams, Benjamin Taskar:
Learning the Parameters of Determinantal Point Process Kernels. ICML 2014: 1224-1232 - Alekh Agarwal, Daniel J. Hsu, Satyen Kale, John Langford, Lihong Li, Robert E. Schapire:
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits. ICML 2014: 1638-1646 - Alekh Agarwal, Sham M. Kakade, Nikos Karampatziakis, Le Song, Gregory Valiant:
Least Squares Revisited: Scalable Approaches for Multi-class Prediction. ICML 2014: 541-549 - Bilal Ahmed, Thomas Thesen, Karen E. Blackmon, Yijun Zhao, Orrin Devinsky, Ruben Kuzniecky, Carla E. Brodley:
Hierarchical Conditional Random Fields for Outlier Detection: An Application to Detecting Epileptogenic Cortical Malformations. ICML 2014: 1080-1088 - Sungjin Ahn, Babak Shahbaba, Max Welling:
Distributed Stochastic Gradient MCMC. ICML 2014: 1044-1052 - Nir Ailon, Zohar Shay Karnin, Thorsten Joachims:
Reducing Dueling Bandits to Cardinal Bandits. ICML 2014: 856-864 - Kareem Amin, Hoda Heidari, Michael J. Kearns:
Learning from Contagion (Without Timestamps). ICML 2014: 1845-1853 - Farhad Pourkamali-Anaraki, Shannon M. Hughes:
Memory and Computation Efficient PCA via Very Sparse Random Projections. ICML 2014: 1341-1349 - Alexandr Andoni, Rina Panigrahy, Gregory Valiant, Li Zhang:
Learning Polynomials with Neural Networks. ICML 2014: 1908-1916 - Andreas Argyriou, Francesco Dinuzzo:
A Unifying View of Representer Theorems. ICML 2014: 748-756 - Sanjeev Arora, Aditya Bhaskara, Rong Ge, Tengyu Ma:
Provable Bounds for Learning Some Deep Representations. ICML 2014: 584-592 - Megasthenis Asteris, Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Nonnegative Sparse PCA with Provable Guarantees. ICML 2014: 1728-1736 - Pranjal Awasthi, Maria-Florina Balcan, Konstantin Voevodski:
Local algorithms for interactive clustering. ICML 2014: 550-558 - Samaneh Azadi, Suvrit Sra:
Towards an optimal stochastic alternating direction method of multipliers. ICML 2014: 620-628 - Mohammad Gheshlaghi Azar, Alessandro Lazaric, Emma Brunskill:
Online Stochastic Optimization under Correlated Bandit Feedback. ICML 2014: 1557-1565 - Elham Azizi, Edoardo M. Airoldi, James E. Galagan:
Learning Modular Structures from Network Data and Node Variables. ICML 2014: 1440-1448 - Philip Bachman, Amir-massoud Farahmand, Doina Precup:
Sample-based approximate regularization. ICML 2014: 1926-1934 - Qinxun Bai, Henry Lam, Stan Sclaroff:
A Bayesian Framework for Online Classifier Ensemble. ICML 2014: 1584-1592 - Anoop Korattikara Balan, Yutian Chen, Max Welling:
Austerity in MCMC Land: Cutting the Metropolis-Hastings Budget. ICML 2014: 181-189 - Borja Balle, William L. Hamilton, Joelle Pineau:
Methods of Moments for Learning Stochastic Languages: Unified Presentation and Empirical Comparison. ICML 2014: 1386-1394 - David Barber, Yali Wang:
Gaussian Processes for Bayesian Estimation in Ordinary Differential Equations. ICML 2014: 1485-1493 - Rémi Bardenet, Arnaud Doucet, Christopher C. Holmes:
Towards scaling up Markov chain Monte Carlo: an adaptive subsampling approach. ICML 2014: 405-413 - Sergey Bartunov, Dmitry P. Vetrov:
Variational Inference for Sequential Distance Dependent Chinese Restaurant Process. ICML 2014: 1404-1412 - Oscar Beijbom, Mohammad J. Saberian, David J. Kriegman, Nuno Vasconcelos:
Guess-Averse Loss Functions For Cost-Sensitive Multiclass Boosting. ICML 2014: 586-594
skipping 281 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-08-17 12:22 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint