HaTT: Hadamard avoiding TT recompression
Fuente:
arXiv
Guardado en:
| Autores principales: | Sun, Zhonghao, Huang, Jizu, Xiao, Chuanfu, Yang, Chao |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A semidefinite programming characterization of the Crawford number
por: Friedland, Shmuel, et al.
Publicado: (2024)
por: Friedland, Shmuel, et al.
Publicado: (2024)
Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
por: Cai, HanQin, et al.
Publicado: (2023)
por: Cai, HanQin, et al.
Publicado: (2023)
HOSCF: Efficient decoupling algorithms for finding the best rank-one approximation of higher-order tensors
por: Xiao, Chuanfu, et al.
Publicado: (2024)
por: Xiao, Chuanfu, et al.
Publicado: (2024)
Randomized algorithms for streaming low-rank approximation in tree tensor network format
por: Bucci, Alberto, et al.
Publicado: (2024)
por: Bucci, Alberto, et al.
Publicado: (2024)
A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
por: Bucci, Alberto, et al.
Publicado: (2024)
por: Bucci, Alberto, et al.
Publicado: (2024)
Fast and Accurate Interpolative Decompositions for General, Sparse, and Structured Tensors
por: Zhang, Yifan, et al.
Publicado: (2025)
por: Zhang, Yifan, et al.
Publicado: (2025)
On semidefinite programming characterizations of the numerical radius and its dual norm
por: Friedland, Shmuel, et al.
Publicado: (2023)
por: Friedland, Shmuel, et al.
Publicado: (2023)
Randomized algorithms for computing the tensor train approximation and their applications
por: Che, Maolin, et al.
Publicado: (2024)
por: Che, Maolin, et al.
Publicado: (2024)
Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts
por: Che, Maolin, et al.
Publicado: (2025)
por: Che, Maolin, et al.
Publicado: (2025)
Where Have All the Kaczmarz Iterates Gone?
por: Bergou, El Houcine, et al.
Publicado: (2025)
por: Bergou, El Houcine, et al.
Publicado: (2025)
A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems
por: Bergou, El Houcine, et al.
Publicado: (2023)
por: Bergou, El Houcine, et al.
Publicado: (2023)
Compression of Currents and Varifolds
por: Paul, Allen, et al.
Publicado: (2024)
por: Paul, Allen, et al.
Publicado: (2024)
Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
por: Matti, Fabio, et al.
Publicado: (2025)
por: Matti, Fabio, et al.
Publicado: (2025)
Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
por: He, Haoze, et al.
Publicado: (2024)
por: He, Haoze, et al.
Publicado: (2024)
Explicit Construction of Approximate Kolmogorov Superpositions with C2 Smoothness
por: Song, Lunji, et al.
Publicado: (2025)
por: Song, Lunji, et al.
Publicado: (2025)
On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
por: Friedland, Shmuel
Publicado: (2023)
por: Friedland, Shmuel
Publicado: (2023)
Hybrid hierarchical matrices with adaptive mixed precision storage
por: Khan, Ritesh, et al.
Publicado: (2026)
por: Khan, Ritesh, et al.
Publicado: (2026)
Stochastic Trace Optimization of Parameter Dependent Matrices Based on Statistical Learning Theory
por: Saibaba, Arvind K., et al.
Publicado: (2025)
por: Saibaba, Arvind K., et al.
Publicado: (2025)
Shortest Paths without a Map, but with an Entropic Regularizer
por: Bubeck, Sébastien, et al.
Publicado: (2022)
por: Bubeck, Sébastien, et al.
Publicado: (2022)
On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
por: López, Francisco, et al.
Publicado: (2023)
por: López, Francisco, et al.
Publicado: (2023)
Quasi-optimal hierarchically semi-separable matrix approximation
por: Amsel, Noah, et al.
Publicado: (2025)
por: Amsel, Noah, et al.
Publicado: (2025)
Sum-of-Gaussians tensor neural networks for high-dimensional Schrödinger equation
por: Zhou, Qi, et al.
Publicado: (2025)
por: Zhou, Qi, et al.
Publicado: (2025)
Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
por: Opris, Andre
Publicado: (2025)
por: Opris, Andre
Publicado: (2025)
Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
por: Koiran, Pascal, et al.
Publicado: (2024)
por: Koiran, Pascal, et al.
Publicado: (2024)
Parallelization Strategies for the Randomized Kaczmarz Algorithm on Large-Scale Dense Systems
por: Ferreira, Inês, et al.
Publicado: (2024)
por: Ferreira, Inês, et al.
Publicado: (2024)
On Convergence of the Secant Method
por: Tan, Yan, et al.
Publicado: (2025)
por: Tan, Yan, et al.
Publicado: (2025)
Matrix-free stochastic calculation of operator norms without using adjoints
por: Bresch, Jonas, et al.
Publicado: (2024)
por: Bresch, Jonas, et al.
Publicado: (2024)
Low-rank approximation of parameter-dependent matrices via CUR decomposition
por: Park, Taejun, et al.
Publicado: (2024)
por: Park, Taejun, et al.
Publicado: (2024)
Randomized Flexible LSQR and LSMR with applications to inverse problems
por: Bucci, Alberto, et al.
Publicado: (2026)
por: Bucci, Alberto, et al.
Publicado: (2026)
Survey of a Class of Iterative Row-Action Methods: The Kaczmarz Method
por: Ferreira, Inês A., et al.
Publicado: (2024)
por: Ferreira, Inês A., et al.
Publicado: (2024)
Runtime Analyses of NSGA-III on Many-Objective Problems
por: Opris, Andre, et al.
Publicado: (2024)
por: Opris, Andre, et al.
Publicado: (2024)
Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
por: Opris, Andre, et al.
Publicado: (2024)
por: Opris, Andre, et al.
Publicado: (2024)
A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
por: Opris, Andre
Publicado: (2025)
por: Opris, Andre
Publicado: (2025)
Matrix perturbation analysis of methods for extracting singular values from approximate singular subspaces
por: Lazzarino, Lorenzo, et al.
Publicado: (2024)
por: Lazzarino, Lorenzo, et al.
Publicado: (2024)
Sharp error bounds for approximate eigenvalues and singular values from subspace methods
por: Haas, Irina-Beatrice, et al.
Publicado: (2025)
por: Haas, Irina-Beatrice, et al.
Publicado: (2025)
Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations
por: Dong, Yijun, et al.
Publicado: (2022)
por: Dong, Yijun, et al.
Publicado: (2022)
Provable Post-Training Quantization: Theoretical Analysis of OPTQ and Qronos
por: Zhang, Haoyu, et al.
Publicado: (2025)
por: Zhang, Haoyu, et al.
Publicado: (2025)
Deterministic computation of quantiles in a Lipschitz framework
por: Gu, Yurun, et al.
Publicado: (2024)
por: Gu, Yurun, et al.
Publicado: (2024)
Linear-Scaling Tensor Train Sketching
por: Cazeaux, Paul, et al.
Publicado: (2026)
por: Cazeaux, Paul, et al.
Publicado: (2026)
A C implementation of the Smith massager algorithm
por: Wang, Ziwen, et al.
Publicado: (2026)
por: Wang, Ziwen, et al.
Publicado: (2026)
Ejemplares similares
-
A semidefinite programming characterization of the Crawford number
por: Friedland, Shmuel, et al.
Publicado: (2024) -
Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
por: Cai, HanQin, et al.
Publicado: (2023) -
HOSCF: Efficient decoupling algorithms for finding the best rank-one approximation of higher-order tensors
por: Xiao, Chuanfu, et al.
Publicado: (2024) -
Randomized algorithms for streaming low-rank approximation in tree tensor network format
por: Bucci, Alberto, et al.
Publicado: (2024) -
A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
por: Bucci, Alberto, et al.
Publicado: (2024)