![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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
Exact 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 227 matches
- 2024
- Loay Raed Mualem, Ethan R. Elenberg, Moran Feldman, Amin Karbasi:
Submodular Minimax Optimization: Finding Effective Sets. AISTATS 2024: 1081-1089 - Amin Karbasi, Kasper Green Larsen:
The Impossibility of Parallelizing Boosting. ALT 2024: 635-653 - Idan Attias, Steve Hanneke, Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas:
Universal Rates for Regression: Separations between Cut-Off and Absolute Loss. COLT 2024: 359-405 - Amir Zandieh, Insu Han, Vahab Mirrokni, Amin Karbasi:
SubGen: Token Generation in Sublinear Time and Memory. CoRR abs/2402.06082 (2024) - Alkis Kalavasis, Amin Karbasi, Kasper Green Larsen, Grigoris Velegkas, Felix Zhou:
Replicable Learning of Large-Margin Halfspaces. CoRR abs/2402.13857 (2024) - Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas, Felix Zhou:
On the Computational Landscape of Replicable Learning. CoRR abs/2405.15599 (2024) - Alkis Kalavasis, Amin Karbasi, Argyris Oikonomou, Katerina Sotiraki, Grigoris Velegkas, Manolis Zampetakis:
Injecting Undetectable Backdoors in Deep Learning and Language Models. CoRR abs/2406.05660 (2024) - 2023
- Moran Feldman, Christopher Harshaw, Amin Karbasi:
How Do You Want Your Greedy: Simultaneous or Repeated? J. Mach. Learn. Res. 24: 72:1-72:87 (2023) - Javid Dadashkarimi
, Amin Karbasi, Qinghao Liang
, Matthew Rosenblatt
, Stephanie Noble
, Maya Foster
, Raimundo X. Rodriguez
, Brendan Adkinson
, Jean Ye
, Huili Sun
, Chris Camp
, Michael Farruggia, Link Tejavibulya, Wei Dai
, Rongtao Jiang, Angeliki Pollatou
, Dustin Scheinost
:
Cross Atlas Remapping via Optimal Transport (CAROT): Creating connectomes for different atlases when raw data is not available. Medical Image Anal. 88: 102864 (2023) - Jane H. Lee, Saeid Haghighatshoar, Amin Karbasi:
Exact Gradient Computation for Spiking Neural Networks via Forward Propagation. AISTATS 2023: 1812-1831 - Javid Dadashkarimi, Matthew Rosenblatt, Amin Karbasi, Dustin Scheinost:
Stacking multiple optimal transport policies to map functional connectomes. CISS 2023: 1-6 - Hossein Esfandiari, Alkis Kalavasis, Amin Karbasi, Andreas Krause, Vahab Mirrokni, Grigoris Velegkas:
Replicable Bandits. ICLR 2023 - Konstantinos E. Nikolakakis, Farzin Haddadpour, Amin Karbasi, Dionysios S. Kalogerias:
Beyond Lipschitz: Sharp Generalization and Excess Risk Bounds for Full-Batch GD. ICLR 2023 - Alkis Kalavasis, Amin Karbasi, Shay Moran, Grigoris Velegkas:
Statistical Indistinguishability of Learning Algorithms. ICML 2023: 15586-15622 - Amin Karbasi, Nikki Lijing Kuang, Yi-An Ma, Siddharth Mitra:
Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning. ICML 2023: 15828-15860 - Amir Zandieh, Insu Han, Majid Daliri, Amin Karbasi:
KDEformer: Accelerating Transformers via Kernel Density Estimation. ICML 2023: 40605-40623 - Idan Attias, Steve Hanneke, Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas:
Optimal Learners for Realizable Regression: PAC Learning and Online Learning. NeurIPS 2023 - Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou:
Replicable Clustering. NeurIPS 2023 - Amin Karbasi, Grigoris Velegkas, Lin Yang, Felix Zhou:
Replicability in Reinforcement Learning. NeurIPS 2023 - Liang Zhang, Junchi Yang, Amin Karbasi, Niao He:
Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization. NeurIPS 2023 - Amin Karbasi, Kasper Green Larsen:
The Impossibility of Parallelizing Boosting. CoRR abs/2301.09627 (2023) - Amir Zandieh, Insu Han, Majid Daliri, Amin Karbasi:
KDEformer: Accelerating Transformers via Kernel Density Estimation. CoRR abs/2302.02451 (2023) - Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou:
Replicable Clustering. CoRR abs/2302.10359 (2023) - Konstantinos E. Nikolakakis, Amin Karbasi, Dionysis Kalogerias
:
Select without Fear: Almost All Mini-Batch Schedules Generalize Optimally. CoRR abs/2305.02247 (2023) - Lin Chen, Gang Fu, Amin Karbasi, Vahab Mirrokni:
Learning from Aggregated Data: Curated Bags versus Random Bags. CoRR abs/2305.09557 (2023) - Alkis Kalavasis, Amin Karbasi, Shay Moran, Grigoris Velegkas:
Statistical Indistinguishability of Learning Algorithms. CoRR abs/2305.14311 (2023) - Loay Mualem, Ethan R. Elenberg, Moran Feldman, Amin Karbasi:
Submodular Minimax Optimization: Finding Effective Sets. CoRR abs/2305.16903 (2023) - Patrik Okanovic, Roger Waleffe, Vasilis Mageirakos, Konstantinos E. Nikolakakis, Amin Karbasi, Dionysios S. Kalogerias, Nezihe Merve Gürel, Theodoros Rekatsinas:
Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learning. CoRR abs/2305.18424 (2023) - Amin Karbasi, Grigoris Velegkas, Lin F. Yang, Felix Zhou:
Replicability in Reinforcement Learning. CoRR abs/2305.19562 (2023) - Amin Karbasi, Nikki Lijing Kuang, Yi-An Ma, Siddharth Mitra:
Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning. CoRR abs/2306.08803 (2023)
skipping 197 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-07-27 15:15 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