default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalid Krichene
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c29]Lynn Chua, Qiliang Cui, Badih Ghazi, Charlie Harrison, Pritish Kamath, Walid Krichene, Ravi Kumar, Pasin Manurangsi, Nicolas Mayoraz, Hema Venkata Krishna Giri Narra, Steffen Rendle, Amer Sinha, Avinash V. Varadarajan, Chiyuan Zhang:
Training Differentially Private Ad Prediction Models With Semi-Sensitive Features. AdKDD@KDD 2024- [c28]Walid Krichene, Nicolas Mayoraz, Steffen Rendle, Shuang Song, Abhradeep Thakurta, Li Zhang:
Private Learning with Public Features. AISTATS 2024: 4150-4158 - [i22]Lynn Chua, Qiliang Cui, Badih Ghazi, Charlie Harrison, Pritish Kamath, Walid Krichene, Ravi Kumar, Pasin Manurangsi, Krishna Giri Narra, Amer Sinha, Avinash V. Varadarajan, Chiyuan Zhang:
Training Differentially Private Ad Prediction Models with Semi-Sensitive Features. CoRR abs/2401.15246 (2024) - 2023
- [j9]Harsh Mehta, Walid Krichene, Abhradeep Guha Thakurta, Alexey Kurakin, Ashok Cutkosky
:
Differentially Private Image Classification from Features. Trans. Mach. Learn. Res. 2023 (2023) - [c27]Walid Krichene, Prateek Jain, Shuang Song, Mukund Sundararajan, Abhradeep Guha Thakurta, Li Zhang:
Multi-Task Differential Privacy Under Distribution Skew. ICML 2023: 17784-17807 - [c26]Mukund Sundararajan, Walid Krichene:
Inflow, Outflow, and Reciprocity in Machine Learning. ICML 2023: 33195-33208 - [c25]Mihaela Curmei, Walid Krichene, Li Zhang, Mukund Sundararajan:
Private Matrix Factorization with Public Item Features. RecSys 2023: 805-812 - [i21]Walid Krichene, Prateek Jain, Shuang Song, Mukund Sundararajan, Abhradeep Thakurta, Li Zhang:
Multi-Task Differential Privacy Under Distribution Skew. CoRR abs/2302.07975 (2023) - [i20]Mihaela Curmei, Walid Krichene, Li Zhang, Mukund Sundararajan:
Private Matrix Factorization with Public Item Features. CoRR abs/2309.11516 (2023) - [i19]Walid Krichene, Nicolas Mayoraz, Steffen Rendle, Shuang Song, Abhradeep Thakurta, Li Zhang:
Private Learning with Public Features. CoRR abs/2310.15454 (2023) - 2022
- [j8]Walid Krichene, Steffen Rendle:
On sampled metrics for item recommendation. Commun. ACM 65(7): 75-83 (2022) - [c24]Steffen Rendle, Walid Krichene, Li Zhang, Yehuda Koren:
Revisiting the Performance of iALS on Item Recommendation Benchmarks. RecSys 2022: 427-435 - [i18]Mukund Sundararajan, Walid Krichene:
Reciprocity in Machine Learning. CoRR abs/2202.09480 (2022) - [i17]Harsh Mehta, Walid Krichene, Abhradeep Thakurta, Alexey Kurakin, Ashok Cutkosky:
Differentially Private Image Classification from Features. CoRR abs/2211.13403 (2022) - 2021
- [c23]Steve Chien, Prateek Jain, Walid Krichene, Steffen Rendle, Shuang Song, Abhradeep Thakurta, Li Zhang:
Private Alternating Least Squares: Practical Private Matrix Completion with Tighter Rates. ICML 2021: 1877-1887 - [c22]Walid Krichene, Steffen Rendle:
On Sampled Metrics for Item Recommendation (Extended Abstract). IJCAI 2021: 4784-4788 - [i16]Steve Chien, Prateek Jain, Walid Krichene, Steffen Rendle, Shuang Song, Abhradeep Thakurta, Li Zhang:
Private Alternating Least Squares: Practical Private Matrix Completion with Tighter Rates. CoRR abs/2107.09802 (2021) - [i15]Steffen Rendle, Walid Krichene, Li Zhang, Yehuda Koren:
Revisiting the Performance of iALS on Item Recommendation Benchmarks. CoRR abs/2110.14037 (2021) - [i14]Steffen Rendle, Walid Krichene, Li Zhang, Yehuda Koren:
iALS++: Speeding up Matrix Factorization with Subspace Optimization. CoRR abs/2110.14044 (2021) - [i13]Harsh Mehta, Steffen Rendle, Walid Krichene, Li Zhang:
ALX: Large Scale Matrix Factorization on TPUs. CoRR abs/2112.02194 (2021) - 2020
- [c21]Walid Krichene, Steffen Rendle:
On Sampled Metrics for Item Recommendation. KDD 2020: 1748-1757 - [c20]Weiwei Kong, Walid Krichene, Nicolas Mayoraz, Steffen Rendle, Li Zhang:
Rankmax: An Adaptive Projection Alternative to the Softmax Function. NeurIPS 2020 - [c19]Steffen Rendle, Walid Krichene, Li Zhang, John R. Anderson:
Neural Collaborative Filtering vs. Matrix Factorization Revisited. RecSys 2020: 240-248 - [i12]John R. Anderson, Qingqing Huang, Walid Krichene, Steffen Rendle, Li Zhang:
Superbloom: Bloom filter meets Transformer. CoRR abs/2002.04723 (2020) - [i11]Steffen Rendle, Walid Krichene, Li Zhang, John R. Anderson:
Neural Collaborative Filtering vs. Matrix Factorization Revisited. CoRR abs/2005.09683 (2020) - [i10]Walid Krichene, Kenneth F. Caluya, Abhishek Halder:
Global Convergence of Second-order Dynamics in Two-layer Neural Networks. CoRR abs/2007.06852 (2020)
2010 – 2019
- 2019
- [c18]Walid Krichene, Nicolas Mayoraz, Steffen Rendle, Li Zhang, Xinyang Yi, Lichan Hong, Ed H. Chi, John R. Anderson:
Efficient Training on Very Large Corpora via Gramian Estimation. ICLR (Poster) 2019 - [i9]Francois Belletti, Karthik Lakshmanan, Walid Krichene, Yi-Fan Chen, John R. Anderson:
Scalable Realistic Recommendation Datasets through Fractal Expansions. CoRR abs/1901.08910 (2019) - [i8]Francois Belletti, Karthik Lakshmanan, Walid Krichene, Nicolas Mayoraz, Yi-Fan Chen, John R. Anderson, Taylor Robie, Tayo Oguntebi, Dan Shirron, Amit Bleiwess:
Scaling Up Collaborative Filtering Data Sets through Randomized Fractal Expansions. CoRR abs/1905.09874 (2019) - 2018
- [j7]Walid Krichene, Milena Suarez Castillo, Alexandre M. Bayen:
On Social Optimal Routing Under Selfish Learning. IEEE Trans. Control. Netw. Syst. 5(1): 479-488 (2018) - [j6]Walid Krichene, Mohamed Chedhli Bourguiba, Kiet Lam, Alexandre M. Bayen:
On Learning How Players Learn: Estimation of Learning Dynamics in the Routing Game. ACM Trans. Cyber Phys. Syst. 2(1): 6:1-6:23 (2018) - [j5]Samitha Samaranayake, Walid Krichene, Jack Reilly, Maria Laura Delle Monache, Paola Goatin, Alexandre M. Bayen:
Discrete-Time System Optimal Dynamic Traffic Assignment (SO-DTA) with Partial Control for Physical Queuing Networks. Transp. Sci. 52(4): 982-1001 (2018) - [i7]Walid Krichene, Nicolas Mayoraz, Steffen Rendle, Li Zhang, Xinyang Yi, Lichan Hong, Ed H. Chi, John R. Anderson:
Efficient Training on Very Large Corpora via Gramian Estimation. CoRR abs/1807.07187 (2018) - 2017
- [c17]Walid Krichene, Peter L. Bartlett:
Acceleration and Averaging in Stochastic Descent Dynamics. NIPS 2017: 6796-6806 - 2016
- [b1]Walid Krichene:
Continuous and Discrete Dynamics For Online Learning and Convex Optimization. University of California, Berkeley, USA, 2016 - [c16]Kiet Lam, Walid Krichene, Alexandre M. Bayen:
On Learning How Players Learn: Estimation of Learning Dynamics in the Routing Game. ICCPS 2016: 8:1-8:10 - [c15]Maximilian Balandat, Walid Krichene, Claire J. Tomlin, Alexandre M. Bayen:
Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games. NIPS 2016: 154-162 - [c14]Walid Krichene, Alexandre M. Bayen, Peter L. Bartlett:
Adaptive Averaging in Accelerated Descent Dynamics. NIPS 2016: 2991-2999 - [i6]Roy Dong, Walid Krichene, Alexandre M. Bayen, S. Shankar Sastry:
Differential Privacy of Populations in Routing Games. CoRR abs/1601.04041 (2016) - [i5]Maximilian Balandat, Walid Krichene, Claire J. Tomlin, Alexandre M. Bayen:
Minimizing Regret on Reflexive Banach Spaces and Learning Nash Equilibria in Continuous Zero-Sum Games. CoRR abs/1606.01261 (2016) - 2015
- [j4]Jack Reilly, Samitha Samaranayake, Maria Laura Delle Monache, Walid Krichene, Paola Goatin, Alexandre M. Bayen:
Adjoint-Based Optimization on a Network of Discretized Scalar Conservation Laws with Applications to Coordinated Ramp Metering. J. Optim. Theory Appl. 167(2): 733-760 (2015) - [j3]Walid Krichene, Benjamin Drighès, Alexandre M. Bayen:
Online Learning of Nash Equilibria in Congestion Games. SIAM J. Control. Optim. 53(2): 1056-1081 (2015) - [c13]Syrine Krichene, Walid Krichene, Roy Dong, Alexandre M. Bayen:
Convergence of heterogeneous distributed learning in stochastic routing games. Allerton 2015: 480-487 - [c12]Samitha Samaranayake, Jack Reilly, Walid Krichene, J. B. Lespiau, Maria Laura Delle Monache, Paola Goatin, Alexandre M. Bayen:
Discrete-time system optimal dynamic traffic assignment (SO-DTA) with partial control for horizontal queuing networks. ACC 2015: 663-670 - [c11]Roy Dong, Walid Krichene, Alexandre M. Bayen, S. Shankar Sastry:
Differential privacy of populations in routing games. CDC 2015: 2798-2803 - [c10]Walid Krichene, Syrine Krichene, Alexandre M. Bayen:
Efficient Bregman projections onto the simplex. CDC 2015: 3291-3298 - [c9]Walid Krichene, Syrine Krichene, Alexandre M. Bayen:
Convergence of mirror descent dynamics in the routing game. ECC 2015: 569-574 - [c8]Walid Krichene, Maximilian Balandat, Claire J. Tomlin, Alexandre M. Bayen:
The Hedge Algorithm on a Continuum. ICML 2015: 824-832 - [c7]Walid Krichene, Alexandre M. Bayen, Peter L. Bartlett:
Accelerated Mirror Descent in Continuous and Discrete Time. NIPS 2015: 2845-2853 - [i4]Walid Krichene:
Dual Averaging on Compactly-Supported Distributions And Application to No-Regret Learning on a Continuum. CoRR abs/1504.07720 (2015) - 2014
- [j2]Maria Laura Delle Monache, Jack Reilly, Samitha Samaranayake, Walid Krichene, Paola Goatin, Alexandre M. Bayen:
A PDE-ODE Model for a Junction with Ramp Buffer. SIAM J. Appl. Math. 74(1): 22-39 (2014) - [j1]Walid Krichene, Jack Reilly, Saurabh Amin, Alexandre M. Bayen:
Stackelberg Routing on Parallel Networks With Horizontal Queues. IEEE Trans. Autom. Control. 59(3): 714-727 (2014) - [c6]Benjamin Drighès, Walid Krichene, Alexandre M. Bayen:
Stability of Nash equilibria in the congestion game under Replicator dynamics. CDC 2014: 1923-1929 - [c5]Walid Krichene, Benjamin Drighès, Alexandre M. Bayen:
On the convergence of no-regret learning in selfish routing. ICML 2014: 163-171 - [i3]Walid Krichene, Benjamin Drighès, Alexandre M. Bayen:
Learning Nash Equilibria in Congestion Games. CoRR abs/1408.0017 (2014) - 2013
- [c4]Farhad Farokhi, Walid Krichene, Alexandre M. Bayen, Karl Henrik Johansson:
A heterogeneous routing game. Allerton 2013: 448-455 - [c3]Yasser Jebbari, Walid Krichene, Jack Reilly, Alexandre M. Bayen:
Stackelberg thresholds on parallel networks with horizontal queues. CDC 2013: 268-274 - [i2]Timothy Hunter, Aude Hofleitner, Jack Reilly, Walid Krichene, Jerome Thai, Anastasios Kouvelas, Pieter Abbeel, Alexandre M. Bayen:
Arriving on time: estimating travel time distributions on large-scale road networks. CoRR abs/1302.6617 (2013) - [i1]Farhad Farokhi, Walid Krichene, Alexandre M. Bayen, Karl Henrik Johansson:
A Necessary and Sufficient Condition for the Existence of Potential Functions for Heterogeneous Routing Games. CoRR abs/1312.1075 (2013) - 2012
- [c2]Walid Krichene, Jack Reilly, Saurabh Amin, Alexandre M. Bayen:
On the characterization and computation of Nash equilibria on parallel networks with horizontal queues. CDC 2012: 7119-7125 - [c1]Walid Krichene, Jack Reilly, Saurabh Amin, Alexandre M. Bayen:
On Stackelberg routing on parallel networks with horizontal queues. CDC 2012: 7126-7132
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-12-08 01:31 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:
