default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNuri Mert Vural
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Nuri Mert Vural, Murat A. Erdogdu:
Pruning is Optimal for Learning Sparse Features in High-Dimensions. COLT 2024: 4787-4861- [i5]Nuri Mert Vural, Murat A. Erdogdu:
Pruning is Optimal for Learning Sparse Features in High-Dimensions. CoRR abs/2406.08658 (2024) - 2022
- [j3]Nuri Mert Vural
, Fatih Ilhan, Selim Firat Yilmaz, Salih Ergüt, Suleyman Serdar Kozat:
Achieving Online Regression Performance of LSTMs With Simple RNNs. IEEE Trans. Neural Networks Learn. Syst. 33(12): 7632-7643 (2022) - [c4]Nuri Mert Vural, Lu Yu, Krishnakumar Balasubramanian, Stanislav Volgushev, Murat A. Erdogdu:
Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance. COLT 2022: 65-102 - [i4]Nuri Mert Vural, Lu Yu, Krishnakumar Balasubramanian, Stanislav Volgushev, Murat A. Erdogdu:
Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance. CoRR abs/2202.11632 (2022) - 2021
- [j2]Nuri Mert Vural, Salih Ergüt, Suleyman Serdar Kozat:
An Efficient and Effective Second-Order Training Algorithm for LSTM-Based Adaptive Learning. IEEE Trans. Signal Process. 69: 2541-2554 (2021) - 2020
- [c3]Fatih Ilhan, Nuri Mert Vural, Suleyman Serdar Kozat:
LSTM-Based Online Learning with Extended Kalman Filter Based Training Algorithm. SIU 2020: 1-4 - [c2]Nuri Mert Vural, Burak Altas, Fatih Ilhan, Suleyman Serdar Kozat:
Online Shortest Path Learning via Convex Optimization. SIU 2020: 1-5 - [c1]Nuri Mert Vural, Burak Altas, Fatih Ilhan, Suleyman Serdar Kozat:
Shortest Path Learning in Non-Stationary Enviroments via Online Convex Optimization. SIU 2020: 1-5 - [i3]Nuri Mert Vural, Fatih Ilhan, Selim Firat Yilmaz, Suleyman Serdar Kozat:
Achieving Online Regression Performance of LSTMs with Simple RNNs. CoRR abs/2005.08948 (2020)
2010 – 2019
- 2019
- [j1]Nuri Mert Vural, Hakan Gökcesu, Kaan Gökcesu, Suleyman Serdar Kozat:
Minimax Optimal Algorithms for Adversarial Bandit Problem With Multiple Plays. IEEE Trans. Signal Process. 67(16): 4383-4398 (2019) - [i2]Nuri Mert Vural, Suleyman Serdar Kozat:
An Efficient EKF Based Algorithm For LSTM-Based Online Learning. CoRR abs/1910.09857 (2019) - [i1]Nuri Mert Vural, Hakan Gökcesu, Kaan Gökcesu, Suleyman Serdar Kozat:
Minimax Optimal Algorithms for Adversarial Bandit Problem with Multiple Plays. CoRR abs/1911.11122 (2019)
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-10-07 22:15 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:
