Nuri Mert Vural

Orcid: 0000-0002-2820-2806

According to our database1, Nuri Mert Vural authored at least 12 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Learning to Recall with Transformers Beyond Orthogonal Embeddings.
CoRR, March, 2026

2025
Learning quadratic neural networks in high dimensions: SGD dynamics and scaling laws.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

2024
Pruning is Optimal for Learning Sparse Features in High-Dimensions.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2022
Achieving Online Regression Performance of LSTMs With Simple RNNs.
IEEE Trans. Neural Networks Learn. Syst., 2022

Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
An Efficient and Effective Second-Order Training Algorithm for LSTM-Based Adaptive Learning.
IEEE Trans. Signal Process., 2021

2020
Achieving Online Regression Performance of LSTMs with Simple RNNs.
CoRR, 2020

Shortest Path Learning in Non-Stationary Enviroments via Online Convex Optimization.
Proceedings of the 28th Signal Processing and Communications Applications Conference, 2020

Online Shortest Path Learning via Convex Optimization.
Proceedings of the 28th Signal Processing and Communications Applications Conference, 2020

LSTM-Based Online Learning with Extended Kalman Filter Based Training Algorithm.
Proceedings of the 28th Signal Processing and Communications Applications Conference, 2020

2019
Minimax Optimal Algorithms for Adversarial Bandit Problem With Multiple Plays.
IEEE Trans. Signal Process., 2019

An Efficient EKF Based Algorithm For LSTM-Based Online Learning.
CoRR, 2019


  Loading...