Publication

Polynomial Escape-Time From Saddle Points In Distributed Non-Convex Optimization

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Polynomial Escape-Time From Saddle Points In Distributed Non-Convex Optimization

Graph Chatbot

Chat with Graph Search

Understanding generalization and robustness in modern deep learning

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

Explainable Face Verification via Feature-Guided Gradient Backpropagation

Unlabeled Principal Component Analysis and Matrix Completion

Coupling a recurrent neural network to SPAD TCSPC systems for real-time fluorescence lifetime imaging

Interpret3C: Interpretable Student Clustering Through Individualized Feature Selection

Social Opinion Formation and Decision Making Under Communication Trends

The multivariate Serre conjecture ring

Linear Complexity Self-Attention With 3rd Order Polynomials

Communication-efficient distributed training of machine learning models