El Houcine Bergou

Orcid: 0000-0001-8685-6974

According to our database1, El Houcine Bergou authored at least 28 papers between 2014 and 2024.

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

2024
Semantic-Aware Resource Allocation in Constrained Networks with Limited User Participation.
CoRR, 2024

Joint Probability Selection and Power Allocation for Federated Learning.
CoRR, 2024

Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimization.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Demystifying the Myths and Legends of Nonconvex Convergence of SGD.
CoRR, 2023

A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems.
CoRR, 2023

Ensemble DNN for Age-of-Information Minimization in UAV-assisted Networks.
Proceedings of the 98th IEEE Vehicular Technology Conference, 2023

Muti-Agent Proximal Policy Optimization For Data Freshness in UAV-assisted Networks.
Proceedings of the IEEE International Conference on Communications, 2023

2022
A Subsampling Line-Search Method with Second-Order Results.
INFORMS J. Optim., October, 2022

A Stochastic Levenberg-Marquardt Method Using Random Models with Complexity Results.
SIAM/ASA J. Uncertain. Quantification, 2022

Direct nonlinear acceleration.
EURO J. Comput. Optim., 2022

Linear Scalarization for Byzantine-robust learning on non-IID data.
CoRR, 2022

Personalized Federated Learning with Communication Compression.
CoRR, 2022

Age-of-Updates Optimization for UAV-assisted Networks.
Proceedings of the IEEE Global Communications Conference, 2022

2021
A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems.
SIAM J. Sci. Comput., 2021

Complexity iteration analysis for strongly convex multi-objective optimization using a Newton path-following procedure.
Optim. Lett., 2021

Client Selection in Federated Learning based on Gradients Importance.
CoRR, 2021

GRACE: A Compressed Communication Framework for Distributed Machine Learning.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Outsmarting the Atmospheric Turbulence for Ground-Based Telescopes Using the Stochastic Levenberg-Marquardt Method.
Proceedings of the Euro-Par 2021: Parallel Processing, 2021

2020
Stochastic Three Points Method for Unconstrained Smooth Minimization.
SIAM J. Optim., 2020

Convergence and Complexity Analysis of a Levenberg-Marquardt Algorithm for Inverse Problems.
J. Optim. Theory Appl., 2020

A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Inverse Problems.
CoRR, 2020

A Stochastic Derivative Free Optimization Method with Momentum.
Proceedings of the 8th International Conference on Learning Representations, 2020

On the Discrepancy between the Theoretical Analysis and Practical Implementations of Compressed Communication for Distributed Deep Learning.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

A Stochastic Derivative-Free Optimization Method with Importance Sampling: Theory and Learning to Control.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2018
A Line-Search Algorithm Inspired by the Adaptive Cubic Regularization Framework and Complexity Analysis.
J. Optim. Theory Appl., 2018

2017
On the use of the energy norm in trust-region and adaptive cubic regularization subproblems.
Comput. Optim. Appl., 2017

2016
Levenberg-Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation.
SIAM/ASA J. Uncertain. Quantification, 2016

2014
The Exact Condition Number of the Truncated Singular Value Solution of a Linear Ill-Posed Problem.
SIAM J. Matrix Anal. Appl., 2014


  Loading...