Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Da Bao
Ghida Ibrahim
Claudia Calabrese
Alexander Puchta
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
WALID KRICHENE
Author Info
Open Visualization
Name
Affiliation
Papers
WALID KRICHENE
Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
32
Collaborators
Citations
PageRank
55
108
14.02
Referers
Referees
References
268
406
224
Search Limit
100
406
Publications (32 rows)
Collaborators (55 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Revisiting the Performance of iALS on Item Recommendation Benchmarks
0
0.34
2022
Private Alternating Least Squares: Practical Private Matrix Completion With Tighter Rates
0
0.34
2021
Neural Collaborative Filtering vs. Matrix Factorization Revisited
16
0.49
2020
On Sampled Metrics for Item Recommendation
11
0.50
2020
Rankmax: An Adaptive Projection Alternative to the Softmax Function
0
0.34
2020
Scalable Realistic Recommendation Datasets through Fractal Expansions.
0
0.34
2019
Scaling Up Collaborative Filtering Data Sets through Randomized Fractal Expansions.
0
0.34
2019
On Social Optimal Routing Under Selfish Learning.
0
0.34
2018
Discrete-Time System Optimal Dynamic Traffic Assignment SO-DTA with Partial Control for Physical Queuing Networks
1
0.38
2018
Efficient Training on Very Large Corpora via Gramian Estimation.
2
0.35
2018
On Learning How Players Learn: Estimation of Learning Dynamics in the Routing Game.
0
0.34
2018
Acceleration and Averaging in Stochastic Descent Dynamics.
2
0.38
2017
Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games.
0
0.34
2016
On Learning How Players Learn: Estimation of Learning Dynamics in the Routing Game.
5
0.45
2016
Adaptive Averaging in Accelerated Descent Dynamics.
0
0.34
2016
Accelerated Mirror Descent in Continuous and Discrete Time
22
1.11
2015
Dual Averaging on Compactly-Supported Distributions And Application to No-Regret Learning on a Continuum.
1
0.36
2015
Convergence of heterogeneous distributed learning in stochastic routing games.
3
0.42
2015
Online Learning of Nash Equilibria in Congestion Games.
9
0.62
2015
The Hedge Algorithm on a Continuum
4
0.47
2015
Adjoint-Based Optimization on a Network of Discretized Scalar Conservation Laws with Applications to Coordinated Ramp Metering.
4
0.45
2015
Convergence of mirror descent dynamics in the routing game
4
0.45
2015
On the convergence of no-regret learning in selfish routing.
1
0.35
2014
A PDE-ODE Model for a Junction with Ramp Buffer.
1
0.36
2014
Stability of Nash equilibria in the congestion game under Replicator dynamics
0
0.34
2014
Stackelberg Routing on Parallel Networks With Horizontal Queues.
11
1.04
2014
Learning Nash Equilibria in Congestion Games.
2
0.42
2014
A heterogeneous routing game
1
0.37
2013
Arriving on time: estimating travel time distributions on large-scale road networks
1
0.36
2013
Stackelberg thresholds on parallel networks with horizontal queues
0
0.34
2013
A Necessary and Sufficient Condition for the Existence of Potential Functions for Heterogeneous Routing Games.
0
0.34
2013
On the characterization and computation of Nash equilibria on parallel networks with horizontal queues.
7
0.63
2012
1