2 papers
math.ST2026
Detecting weighted hidden cliques
Urmisha Chatterjee, Karissa Huang, Ritabrata Karmakar +5
We study a generalization of the classical hidden clique problem to graphs with real-valued edge weights. Formally, we define a hypothesis testing problem. Under the null hypothesi…
cs.LG2025
Convergence of continuous-time stochastic gradient descent with applications to deep neural networks
Gabor Lugosi, Eulalia Nualart
We study a continuous-time approximation of the stochastic gradient descent process for minimizing the population expected loss in learning problems. The main results establish gen…