default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael R. Metel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j7]Michael R. Metel:
Sparse Training with Lipschitz Continuous Loss Functions and a Weighted Group L0-norm Constraint. J. Mach. Learn. Res. 24: 103:1-103:44 (2023)- 2022
- [j6]Antoine Deza
, Kai Huang, Michael R. Metel:
Charging station optimization for balanced electric car sharing. Discret. Appl. Math. 308: 187-197 (2022) - [j5]Michael R. Metel, Akiko Takeda:
Perturbed Iterate SGD for Lipschitz Continuous Loss Functions. J. Optim. Theory Appl. 195(2): 504-547 (2022) - 2021
- [j4]Michael R. Metel, Akiko Takeda:
Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization. J. Mach. Learn. Res. 22: 115:1-115:36 (2021) - [j3]Michael R. Metel, Akiko Takeda:
Primal-dual subgradient method for constrained convex optimization problems. Optim. Lett. 15(4): 1491-1504 (2021) - 2018
- [j2]Michael R. Metel:
Kelly Betting on Horse Races with Uncertainty in Probability Estimates. Decis. Anal. 15(1): 47-52 (2018) - [j1]Antoine Deza, Kai Huang, Michael R. Metel:
Managing losses in exotic horse race wagering. J. Oper. Res. Soc. 69(3): 319-325 (2018)
Conference and Workshop Papers
- 2024
- [c2]Michael R. Metel, Peng Lu, Boxing Chen, Mehdi Rezagholizadeh, Ivan Kobyzev:
Draft on the Fly: Adaptive Self-Speculative Decoding using Cosine Similarity. EMNLP (Findings) 2024: 2267-2272 - 2019
- [c1]Michael R. Metel, Akiko Takeda:
Simple Stochastic Gradient Methods for Non-Smooth Non-Convex Regularized Optimization. ICML 2019: 4537-4545
Informal and Other Publications
- 2024
- [i5]Michael R. Metel, Peng Lu, Boxing Chen, Mehdi Rezagholizadeh, Ivan Kobyzev:
Draft on the Fly: Adaptive Self-Speculative Decoding using Cosine Similarity. CoRR abs/2410.01028 (2024) - [i4]Michael R. Metel, Boxing Chen, Mehdi Rezagholizadeh:
Batch-Max: Higher LLM Throughput using Larger Batch Sizes and KV Cache Compression. CoRR abs/2412.05693 (2024) - 2023
- [i3]Vahid Partovi Nia, Guojun Zhang, Ivan Kobyzev, Michael R. Metel, Xinlin Li, Ke Sun, Sobhan Hemati, Masoud Asgharian, Linglong Kong, Wulong Liu, Boxing Chen:
Mathematical Challenges in Deep Learning. CoRR abs/2303.15464 (2023) - 2022
- [i2]Michael R. Metel:
Variants of SGD for Lipschitz Continuous Loss Functions in Low-Precision Environments. CoRR abs/2211.04655 (2022) - 2014
- [i1]Antoine Deza, Kai Huang, Michael R. Metel:
Chance Constrained Optimization for Targeted Internet Advertising. CoRR abs/1407.7924 (2014)
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 2025-01-21 00:24 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:
