default search action
Mehmet A. Donmez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c12]Mehmet A. Donmez, Jeffrey Ludwig, Maxim Raginsky, Andrew C. Singer:
EE-Grad: Exploration and Exploitation for Cost-Efficient Mini-Batch SGD. ACSCC 2021: 490-497
2010 – 2019
- 2017
- [b1]Mehmet A. Donmez:
Robust and reliable decision-making systems and algorithms. University of Illinois Urbana-Champaign, USA, 2017 - [i9]Mehmet A. Donmez, Maxim Raginsky, Andrew C. Singer:
EE-Grad: Exploration and Exploitation for Cost-Efficient Mini-Batch SGD. CoRR abs/1705.07070 (2017) - [i8]Mehmet A. Donmez, Maxim Raginsky, Andrew C. Singer, Lav R. Varshney:
Cost-Performance Tradeoffs in Fusing Unreliable Computational Units. CoRR abs/1705.07779 (2017) - 2016
- [j8]N. Denizcan Vanli, Sait Tunç, Mehmet A. Donmez, Suleyman Serdar Kozat:
Growth optimal investment in discrete-time markets with proportional transaction costs. Digit. Signal Process. 48: 226-238 (2016) - [j7]Mehmet A. Donmez, Maxim Raginsky, Andrew C. Singer
:
Online Optimization Under Adversarial Perturbations. IEEE J. Sel. Top. Signal Process. 10(2): 256-269 (2016) - [c11]Mehmet A. Donmez, Maxim Raginsky, Andrew C. Singer
Cost-performance tradeoffs in unreliable computation architectures. ACSSC 2016: 215-219 - 2015
- [j6]N. Denizcan Vanli, Mehmet A. Donmez, Suleyman Serdar Kozat:
Robust least squares methods under bounded data uncertainties. Digit. Signal Process. 36: 82-92 (2015) - [j5]Huseyin Ozkan
A Deterministic Analysis of an Online Convex Mixture of Experts Algorithm. IEEE Trans. Neural Networks Learn. Syst. 26(7): 1575-1580 (2015) - 2014
- [c10]Mehmet A. Donmez, Andrew C. Singer
Sequential prediction of individual sequences in the presence of computational errors. ACSSC 2014: 1773-1778 - [c9]Nuri Denizcan Vanli, Suleyman Serdar Kozat, Mehmet A. Donmez:
Robust regularized least squares estimation in the presence of bounded data uncertainties. ICASSP 2014: 5637-5640 - 2013
- [j4]Mehmet A. Donmez, Huseyin A. Inan, Suleyman Serdar Kozat:
Adaptive mixture methods based on Bregman divergences. Digit. Signal Process. 23(1): 86-97 (2013) - [j3]Mehmet A. Donmez, Huseyin A. Inan, Suleyman Serdar Kozat:
Robust estimation in flat fading channels under bounded channel uncertainties. Digit. Signal Process. 23(5): 1592-1601 (2013) - [j2]Sait Tunç, Mehmet A. Donmez, Suleyman Serdar Kozat:
Optimal Investment Under Transaction Costs: A Threshold Rebalanced Portfolio Approach. IEEE Trans. Signal Process. 61(12): 3129-3142 (2013) - [c8]Huseyin Ozkan
Competitive and online piecewise linear classification. ICASSP 2013: 3452-3456 - [c7]Sait Tunç, Mehmet A. Donmez, Suleyman Serdar Kozat:
Growth optimal investment with threshold rebalancing portfolios under transaction costs. ICASSP 2013: 8717-8721 - [i7]N. Denizcan Vanli, Mehmet A. Donmez, Suleyman Serdar Kozat:
Robust LS Equalization Methods for MIMO Systems Under Bounded Model Uncertainties. CoRR abs/1311.6402 (2013) - 2012
- [j1]Mehmet A. Donmez, Suleyman Serdar Kozat:
Steady State and Transient MSE Analysis of Convexly Constrained Mixture Methods. IEEE Trans. Signal Process. 60(6): 3314-3321 (2012) - [c6]Mehmet A. Donmez, Suleyman Serdar Kozat:
Steady state MSE analysis of convexly constrained mixture methods. CIP 2012: 1-4 - [c5]Huseyin A. Inan, Mehmet A. Donmez, Suleyman Serdar Kozat:
Adaptive mixture methods using Bregman divergences. ICASSP 2012: 3781-3784 - [c4]Nargiz Kalantarova, Mehmet A. Donmez, Suleyman Serdar Kozat:
Competitive least squares problem with bounded data uncertainties. ICASSP 2012: 3841-3844 - [c3]Mehmet A. Donmez, Huseyin Ozkan
Transient analysis of convexly constrained mixture methods. MLSP 2012: 1-5 - [c2]Mehmet A. Donmez, Sait Tunç, Suleyman Serdar Kozat:
Optimal portfolios under transaction costs in discrete time markets. MLSP 2012: 1-6 - [c1]Mehmet A. Donmez, Sait Tunç, Suleyman Serdar Kozat:
Growth optimal portfolios in discrete-time markets under transaction costs. SPAWC 2012: 500-504 - [i6]Sait Tunç, Mehmet A. Donmez, Suleyman Serdar Kozat:
Growth Optimal Portfolios in Discrete-time Markets Under Transaction Costs. CoRR abs/1203.4153 (2012) - [i5]Nargiz Kalantarova, Mehmet A. Donmez, Suleyman Serdar Kozat:
A Novel Robust Approach to Least Squares Problems with Bounded Data Uncertainties. CoRR abs/1203.4160 (2012) - [i4]Mehmet A. Donmez, Sait Tunç, Suleyman Serdar Kozat:
A New Analysis of an Adaptive Convex Mixture: A Deterministic Approach. CoRR abs/1203.4209 (2012) - [i3]Mehmet A. Donmez, Huseyin A. Inan, Suleyman Serdar Kozat:
Adaptive Mixture Methods Based on Bregman Divergences. CoRR abs/1203.4598 (2012) - [i2]Mehmet A. Donmez, Huseyin A. Inan, Suleyman Serdar Kozat:
Robust Estimation in Rayleigh Fading Channels Under Bounded Channel Uncertainties. CoRR abs/1209.6405 (2012) - [i1]Mehmet A. Donmez, Sait Tunç, Suleyman Serdar Kozat:
A Deterministic Analysis of an Online Convex Mixture of Expert Algorithms. CoRR abs/1209.6409 (2012)
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-04-25 05:47 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: