Pasha Snopov

22 posts

Pasha Snopov

Pasha Snopov

@fin_presented

PhD at UTRGV / ex-RAS ex-Phystech @mipt_eng

Katılım Mart 2023
155 Takip Edilen24 Takipçiler
Pasha Snopov
Pasha Snopov@fin_presented·
Steppin towards automated conjecture generation. Stop by our poster!
German Magai@MetatrolN

AI4Math research focuses on Lean autoformalization and theorem proving. But how do we come up with new conjectures? In our work with @fin_presented, we study how well can LLM agents use computation to create hypotheses and solve research-level mathematical problems? arXiv: arxiv.org/abs/2607.06820 We evaluate 15 LLMs in zero-shot and SageMath-augmented agentic setup on RealMath 133 problems extracted from arXiv mathematical papers. Key findings: - Tool access improves every model, by 9.7 pp on average. Open-weight models gain 15.3 pp, compared with 6.5 pp for closed frontier models, narrowing the gap between them. - Most intriguingly, a CAS-augmented agent reproduced a computational mathematician’s workflow: computing intermediate objects, finding patterns, forming conjectures, recovering from errors, and validating formulas across parameters (see the details in the case study). - Gains vary: #Qwen 3.7-Max rises from 42.1% to 69.9%, a gain of 27.8 pp that brings it close to frontier performance. #Kimi 2.7 gains only 1.5 pp. - Tool-use behavior is strongly bimodal. Strong agents usually finish in 3-4 tool turns, while weaker agents often exhaust all tool budgets. - The largest gains are in combinatorics (+18.7 pp) and rings and algebras (+10.7 pp), while algebraic topology and group theory remain difficult. - Recovery after a failed tool call ranges from 16% (#Sonnet-5) to 77% (GPT-5.5) across models. The ability to revise a strategy after receiving computational feedback separates effective agents more clearly than the raw number of errors. Interesting observations about some models: - #GPT 5.5 leads in both solve rate and efficiency, reaching a 75.2% accuracy with the lowest token usage among tool-enabled agents. - #MiniMax M3 is the least efficient, using the most tokens per problem and achieving substantially lower accuracy. - #Opus 4.8 exceeds Opus 4.7 by only one solved problem. - #Grok 4.3 shows one of the worst results and produces 248/336 SyntaxErrors🥲. - #Fugu Ultra shows the smallest increase in token usage with tool access, at 4.5×, averaging 70k tokens per problem. Today we are presenting our poster at the @ai4mathworkshop at @icmlconf. Come by to discuss our work. #ICML2026 #AI4Math #AI #Agentic #LLM #Mathematics

English
0
0
1
28
Pasha Snopov retweetledi
Noeon Research
Noeon Research@NoeonAI·
Our LLM Applied Scientist German Magai @MetatrolN presents at the 3rd AI For Math Workshop at ICML 2026 (July 11, Seoul): "Evaluating SageMath-Augmented LLM Agents for Computational and Experimental Mathematics" with Pavel Snopov @fin_presented (UT Rio Grande Valley). Give frontier models a computer algebra system and watch them work like mathematicians: guess, compute, break something, fix it, check the pattern, commit. The size of the payoff had little to do with model strength. What set the winners apart was recovering after a failed call, not raw reasoning. If you're at ICML 2026, find German on the 11th to chat about agentic reasoning, math, and why more tokens don’t automatically mean more right answers.
Noeon Research tweet media
English
0
3
5
870
Pasha Snopov retweetledi
Mathieu
Mathieu@miniapeur·
"mom, how did we get so poor?" "your dad started a PhD"
Mathieu tweet media
English
16
95
1.4K
42.1K
Pasha Snopov retweetledi
Valence Labs
Valence Labs@valence_ai·
We curated 40+ quantum mechanics datasets covering 250+ quantum methods & 1.5B geometries. All of this is easily accessible through the OpenQDC library. 🧵 Harness the power of QM data with a single line of code: openqdc.io Blog: valencelabs.com/blog-posts/ope…
Valence Labs tweet media
English
2
16
59
5K
Pasha Snopov retweetledi
Mathilde Papillon🦋 mathildepapillon .bsky .social
What if any neural network could go topological? While being just as (or more) general, equivariant, and expressive as other Topological Deep Learning models? Without a hacky, case-by-case software struggle? I am beyond excited to introduce TopoTune💫 arxiv.org/pdf/2410.06530
Mathilde Papillon🦋 mathildepapillon .bsky .social tweet media
English
9
51
261
31.7K
Simo Ryu
Simo Ryu@cloneofsimo·
99% ML engineer i talked to don't realize gradient is actually defined via inner product. If you have a different definition of inner product (metric), you have different definition of gradient. This will free up your mind.. now preconditioning and layerwise lr tuning makes lot more sense: its actually redefining your notion of distance.
English
28
70
1.5K
458.7K
Pasha Snopov
Pasha Snopov@fin_presented·
@short_cast @cloneofsimo It seems to me that it is important to remain on the embedded manifold. But if you take gradient steps in the ambient space, you risk moving away from it, don't you?
English
1
0
0
525
Kirill Pavlenko
Kirill Pavlenko@short_cast·
@cloneofsimo Imho, you can always think of your data manifold being crazy curved, but you embedded it into higher dim flat space and do gradient steps in this space, so no need to worry about metric
English
2
0
35
9K
Pasha Snopov
Pasha Snopov@fin_presented·
It’s been a week since we wrapped up an exciting school on topology, combinatorics, and data analysis in Voronezh, coorganized with my friends @bekemax, Andrey Ryabichev, and Dima Vasiliev. Tnx to CS HSE and AMM VSU for the support! More info (in Russian): is.gd/kWnTke
English
1
1
2
242
Pasha Snopov retweetledi
geomstats
geomstats@geomstats·
Geomstats 2.8.0 is out: Discover differential geometry for learning in Python! 🌐 30+ manifolds 🌐 Connections & Riemannian metrics: geodesics, exp & log maps, parallel transport, curvatures 🌐 Lie groups, fiber bundles, quotient spaces, stratified spaces github.com/geomstats/geom…
geomstats tweet media
English
1
29
103
17.3K
Pasha Snopov retweetledi
Connected Data
Connected Data@Connected_Data·
Deep Learning on Graphs: Past, Present, And Future Graph representation learning has recently become one of the hottest topics in machine learning. One particular instance, graph neural networks, is being used in a broad spectrum of applications ranging from 3D computer vision and graphics to high energy physics and drug design. Despite the promise and a series of success stories of graph deep learning methods, we have not witnessed so far anything close to the smashing success convolutional networks have had in computer vision. In this talk, Michael Bronstein outlines his views on the possible reasons and how the field could progress in the next few years. Listen to this episode for a succinct introduction to GNNs, and find for yourselves how Michael Bronstein’s predictions and points from Knowledge Connexions 2020 holding up in 2024. –- @mmbronstein is a professor at Imperial College London, where he holds the Chair in Machine Learning and Pattern Recognition, and Head of Graph Learning Research at Twitter. He also heads ML research in Project CETI, a TED Audacious Prize-winning collaboration aimed at understanding the communication of sperm whales. --- To learn more about Graph AI, Knowledge Graphs, and LLMs and meet Leaders and Innovators join us in Connected Data London on December 11-13. We've been working with Knowledge Graphs for more than 20 years, and sharing it with the world since 2016. #KnowledgeGraph #ConnectedData #datascience #podcast #KnowCon2020 #GNN #DeepLearning #MachineLearning #EmergingTech #AI pod.co/the-connected-…
Connected Data tweet media
English
1
13
27
2K
Pasha Snopov retweetledi
Mathieu
Mathieu@miniapeur·
Mathieu tweet media
ZXX
6
91
1.2K
107K
Pasha Snopov retweetledi
Evan Washington
Evan Washington@evanewashington·
@littmath the only recipes i can follow are morphisms in a monoidal category
Evan Washington tweet media
English
3
10
193
8.5K
Pasha Snopov retweetledi
Grant Sanderson
Grant Sanderson@3blue1brown·
Has anyone ever come across this way of visualizing the convolution of two functions f and g: Look at the graph of the two-variable function f(x)g(y), and consider diagonal slices over the line x + y = k. The area of those slices represents (f * g)(k).
English
40
229
2.8K
397.3K
Pasha Snopov
Pasha Snopov@fin_presented·
Same here, I was struggling with groups and other algebra-101 things, but then I’ve reached chapter 0 and everything has changed
English
0
0
1
51
Pasha Snopov
Pasha Snopov@fin_presented·
I wanted to score 100 points, but I was just a little short. I scored the least in Speaking; perhaps my laptop's built-in microphone was what hindered me from hitting that perfect 100. Or maybe not 🤨
English
0
0
0
31
Pasha Snopov
Pasha Snopov@fin_presented·
I took the TOEFL and managed to score 99/120 points 🥳
Pasha Snopov tweet media
English
1
0
0
57