theory of machine learning and inference on random graphs - PhD candidate @KCLDisorder 🌻

Joined March 2018
11 Photos and videos
Another succesful PhD information event for our UG and MSc students at @kclmathematics under the umbrella of the @_Piscopia initiative 💅🏻 Big thanks to fellow PhD students L. Servius, A. Borkowski and @ShahpoOmar for their time!
6
18
586
Urte Adomaityte retweeted
🚨POSTDOCTORAL POSITION AVAILABLE🚨 in Complex Systems Modelling, Quantitative Modelling of Legal Complexity and Infonomics under my supervision in the [quantlaw.co.uk/] Lab at @KCLDisorder @kclmathematics. Competitive salary, fixed term (27 months). Deadline 10th Jan 👇

1
15
29
7,455
my first submission to #NeurIPS2023 was accepted !! additional results on Bayes-optimal performance and a separability threshold formula big thanks to @gabrielescr and @PierpaoloVivo ! @KCLDisorder @kclmathematics
fat tails alert!!! latest preprint on theory of machine leaning with @gabrielescr and @PierpaoloVivo at @KCLDisSyst : arxiv.org/abs/2304.02912 1/
2
26
1,664
Urte Adomaityte retweeted
The past two weeks were a blast in Cargèse at "Statistical Physics & Machine Learning Back Together Again" cargese2023.github.io/. Around 100 of the top people in the field, including the next generation, discussed a lot of great science. I will miss you guys. We will be back!
1
8
116
15,576
Data separability/MLE-existence threshold? Computationally extracting with logistic loss: fatter tails -> more samples one can correctly classify; the threshold approaches known Gaussian data formula as a->inf. Infinite variance: Cover's result n_samples=2*dim is recovered 8/
1
322
What if labels are random? The training loss (bottom) is independent from the variance distribution, thus universal even for infinite variance (yellow)! No universality for test and train errors though. Thanks for reading! 9/9
2
255
(1/N) First preprint alert! Here is a hyper-twist on planted matching problems for anyone interested in statistical physics methods for inference 🧵 In collaboration with @gabrielescr @zdeborova @toshniwal8 Link: arxiv.org/abs/2209.03423 @KCLDisSyst

1
12
55
(8/N) As coordination k of the hyperedges grows, we have easier recovery — the partial recovery phase shrinks. Also, the region in which it is information-theoretically impossible to fully reconstruct the signal (hard phase) rapidly shrinks to zero.
1
(N/N) Bonus: mixed case of edges and 3-hyperedges — first-order phase transition persists but presence of a finite fraction of edges in the hypergraph makes the transition of second order. Thanks for reading!
1