default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaksim Rakhuba
Person information
- affiliation: ETH Zurich, Seminar for Applied Mathematics, Switzerland
- affiliation: Skolkovo Institute of Science and Technology, Moscow, Russia
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Ivan Peshekhonov, Aleksey Arzhantsev, Maxim V. Rakhuba:
Training a Tucker Model With Shared Factors: a Riemannian Optimization Approach. AISTATS 2024: 3304-3312- [c6]Nikita Puchkin, Maxim V. Rakhuba:
Dimension-free Structured Covariance Estimation. COLT 2024: 4276-4306 - 2023
- [j12]Ivan V. Oseledets, Maxim V. Rakhuba, André Uschmajew:
Local convergence of alternating low-rank optimization methods with overrelaxation. Numer. Linear Algebra Appl. 30(3) (2023) - [j11]Lev I. Vysotsky
, Maxim V. Rakhuba:
Tensor rank bounds and explicit QTT representations for the inverses of circulant matrices. Numer. Linear Algebra Appl. 30(3) (2023) - 2022
- [j10]Carlo Marcati, Maksim Rakhuba, Christoph Schwab:
Tensor rank bounds for point singularities in ℝ3. Adv. Comput. Math. 48(3): 18 (2022) - [j9]Vladimir A. Kazeev, Ivan V. Oseledets, Maxim V. Rakhuba, Christoph Schwab:
Quantized Tensor FEM for Multiscale Problems: Diffusion Problems in Two and Three Dimensions. Multiscale Model. Simul. 20(3): 893-935 (2022) - [j8]Alexander Novikov, Maxim V. Rakhuba, Ivan V. Oseledets:
Automatic Differentiation for Riemannian Optimization on Low-Rank Matrix and Tensor-Train Manifolds. SIAM J. Sci. Comput. 44(2): 843- (2022) - [c5]Alexandra Senderovich, Ekaterina Bulatova, Anton Obukhov, Maxim V. Rakhuba:
Towards Practical Control of Singular Values of Convolutional Layers. NeurIPS 2022 - [i11]Lev I. Vysotsky, Maxim V. Rakhuba:
Tensor rank bounds and explicit QTT representations for the inverses of circulant matrices. CoRR abs/2205.04335 (2022) - [i10]Alexandra Senderovich, Ekaterina Bulatova, Anton Obukhov, Maxim V. Rakhuba:
Towards Practical Control of Singular Values of Convolutional Layers. CoRR abs/2211.13771 (2022) - 2021
- [j7]Maxim V. Rakhuba:
Robust Alternating Direction Implicit Solver in Quantized Tensor Formats for a Three-Dimensional Elliptic PDE. SIAM J. Sci. Comput. 43(2): A800-A827 (2021) - [c4]Anton Obukhov, Maxim V. Rakhuba, Alexander Liniger, Zhiwu Huang, Stamatios Georgoulis, Dengxin Dai, Luc Van Gool:
Spectral Tensor Train Parameterization of Deep Learning Layers. AISTATS 2021: 3547-3555 - [c3]Mikhail Usvyatsov, Anastasia Makarova, Rafael Ballester-Ripoll, Maxim V. Rakhuba, Andreas Krause, Konrad Schindler:
Cherry-Picking Gradients: Learning Low-Rank Embeddings of Visual Data via Differentiable Cross-Approximation. ICCV 2021: 11406-11415 - [i9]Anton Obukhov, Maxim V. Rakhuba, Alexander Liniger, Zhiwu Huang, Stamatios Georgoulis, Dengxin Dai, Luc Van Gool:
Spectral Tensor Train Parameterization of Deep Learning Layers. CoRR abs/2103.04217 (2021) - [i8]Alexander Novikov, Maxim V. Rakhuba, Ivan V. Oseledets:
Automatic differentiation for Riemannian optimization on low-rank matrix and tensor-train manifolds. CoRR abs/2103.14974 (2021) - [i7]Mikhail Usvyatsov, Anastasia Makarova, Rafael Ballester-Ripoll, Maxim V. Rakhuba, Andreas Krause, Konrad Schindler:
Cherry-Picking Gradients: Learning Low-Rank Embeddings of Visual Data via Differentiable Cross-Approximation. CoRR abs/2105.14250 (2021) - [i6]Ivan V. Oseledets, Maxim V. Rakhuba, André Uschmajew:
Local convergence of alternating low-rank optimization methods with overrelaxation. CoRR abs/2111.14758 (2021) - 2020
- [c2]Anton Obukhov, Maxim V. Rakhuba, Stamatios Georgoulis, Menelaos Kanakis, Dengxin Dai, Luc Van Gool:
T-Basis: a Compact Representation for Neural Networks. ICML 2020: 7392-7404 - [i5]Vladimir A. Kazeev, Ivan V. Oseledets, Maksim Rakhuba, Christoph Schwab:
Quantized tensor FEM for multiscale problems: diffusion problems in two and three dimensions. CoRR abs/2006.01455 (2020) - [i4]Anton Obukhov, Maxim V. Rakhuba, Stamatios Georgoulis, Menelaos Kanakis, Dengxin Dai, Luc Van Gool:
T-Basis: a Compact Representation for Neural Networks. CoRR abs/2007.06631 (2020) - [i3]Carlo Marcati, Maxim V. Rakhuba, Johan E. M. Ulander:
Low rank tensor approximation of singularly perturbed partial differential equations in one dimension. CoRR abs/2010.06919 (2020)
2010 – 2019
- 2019
- [j6]Maxim V. Rakhuba, Alexander Novikov, Ivan V. Oseledets:
Low-rank Riemannian eigensolver for high-dimensional Hamiltonians. J. Comput. Phys. 396: 718-737 (2019) - [i2]Carlo Marcati, Maxim V. Rakhuba, Christoph Schwab:
Tensor Rank bounds for Point Singularities in R3. CoRR abs/1912.07996 (2019) - 2018
- [j5]Ivan V. Oseledets, Maxim V. Rakhuba, André Uschmajew:
Alternating Least Squares as Moving Subspace Correction. SIAM J. Numer. Anal. 56(6): 3459-3479 (2018) - [j4]M. V. Rakhuba, Ivan V. Oseledets:
Jacobi-Davidson Method on Low-Rank Matrix Manifolds. SIAM J. Sci. Comput. 40(2) (2018) - 2017
- [j3]Vladimir A. Kazeev, Ivan V. Oseledets, Maksim Rakhuba, Christoph Schwab:
QTT-finite-element approximation for multiscale problems I: model problems in one dimension. Adv. Comput. Math. 43(2): 411-442 (2017) - [i1]Valentin Khrulkov, M. V. Rakhuba, Ivan V. Oseledets:
Vico-Greengard-Ferrando quadratures in the tensor solver for integral equations. CoRR abs/1704.01669 (2017) - 2016
- [j2]M. V. Rakhuba, Ivan V. Oseledets:
Grid-based electronic structure calculations: The tensor decomposition approach. J. Comput. Phys. 312: 19-30 (2016) - 2015
- [j1]M. V. Rakhuba, Ivan V. Oseledets:
Fast Multidimensional Convolution in Low-Rank Tensor Formats via Cross Approximation. SIAM J. Sci. Comput. 37(2) (2015) - [c1]Vadim Lebedev, Yaroslav Ganin, Maksim Rakhuba, Ivan V. Oseledets, Victor S. Lempitsky:
Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition. ICLR (Poster) 2015
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-06 23:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
