Rustem Takhanov
Rustem Takhanov is a mathematician at Nazarbayev University whose research spans discrete geometry, combinatorics, optimization, machine learning theory, and theoretical computer science.
Affiliations
Nazarbayev University
2015–2026 · 35 publications
Linköping University
2010–2012 · 2 publications
Russian Academy of Sciences
2007–2010 · 3 publications
Dorodnitsyn Computing Centre
2007–2010 · 3 publications
Publications61
- 442010
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Article · DROPS STACS, CORE A · PDF
- 282020
Fourier neural networks: A comparative study - INTELLIGENT DATA ANALYSIS, 2020
Article · Intelligent Data Analysis · with Zhenisbek Assylbekov
- 162017
Syllable-aware Neural Language Models: A Failure to Beat Character-aware Ones
Talk · Conference on Empirical Methods in Natural Language Processing CORE A* · with Zhenisbek Assylbekov · PDF
- 152010
Extensions of the Minimum Cost Homomorphism Problem
Talk · Lecture notes in computer science
- 122019
Context Vectors Are Reflections of Word Vectors in Half the Dimensions
Article · Nazarbayev University Repository · with Zhenisbek Assylbekov · Open access
- 102015
Inference Algorithms for Pattern-Based CRFs on Sequence Data
Article · Algorithmica Q1 · PDF
- 92018
Reusing Weights in Subword-Aware Neural Language Models
Talk · Nazarbayev University Repository · with Zhenisbek Assylbekov · PDF
- 82022
On the speed of uniform convergence in Mercer's theorem
Article · Journal of Mathematical Analysis and Applications Q1 · PDF
- 72015
Effectiveness of Structural Restrictions for Hybrid CSPs
Talk · Lecture notes in computer science · PDF
- 52017
Hybrid VCSPs with Crisp and Valued Conservative Templates
Article · Nazarbayev University Repository · PDF
- 52007
A Dichotomy Theorem for General Minimum Cost Homomorphism Problem
Preprint · arXiv · PDF
- 42015
Hybrid (V)CSPs and algebraic reductions.
Preprint · arXiv · Open access
- 32023
Autoencoders for a manifold learning problem with a jacobian rank constraint
Article · Pattern Recognition Q1 · PDF
- 32017
Patterns Versus Characters in Subword-Aware Neural Language Modeling
Talk · Lecture notes in computer science · with Zhenisbek Assylbekov
- 22025
Gradient descent fails to learn high-frequency functions and modular arithmetic
Article · Machine Learning Q1 · with Arman Bolatov, Zhenisbek Assylbekov
- 22022
Reducing the dimensionality of data using tempered distributions
Article · Digital Signal Processing Q1 · PDF
- 22022
Combining pattern-based CRFs and weighted context-free grammars
Article · Intelligent Data Analysis · PDF
- 22019
Semantics- and Syntax-related Subvectors in the Skip-gram Embeddings
Preprint · arXiv · with Zhenisbek Assylbekov · PDF
- 12026
Deep Linear Discriminant Analysis Revisited
Article · Machine Learning Q1 · with Arman Bolatov, Zhenisbek Assylbekov · PDF
- 12024
Almost pairwise independence and resilience to deep learning attacks
Article · IACR Communications in Cryptology · PDF
- 12024
- 12023
Intractability of Learning the Discrete Logarithm with Gradient-Based Methods
Preprint · arXiv · with Zhenisbek Assylbekov, Arman Bolatov · PDF
- 12022
The algebraic structure of the densification and the sparsification tasks for CSPs
Article · Constraints · PDF
- 12022
Learning the pattern-based CRF for prediction of a protein local structure
Article · Informatica · PDF
