:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Little, Max A., He, Xi, Kayas, Ugur
Format:	Preprint
Published:	2021
Subjects:	Data Structures and Algorithms Machine Learning Rings and Algebras
Online Access:	https://arxiv.org/abs/2107.01752
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
by: He, Xi, et al.
Published: (2023)

Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules
by: He, Xi, et al.
Published: (2025)

Factorizing the Brauer monoid in polynomial time
by: Marchei, Daniele, et al.
Published: (2024)

On the uniqueness and computation of commuting extensions
by: Koiran, Pascal
Published: (2024)

Polynomial Algorithms for Simultaneous Unitary Similarity and Equivalence
by: VJ, Harikrishna, et al.
Published: (2025)

Asynchronous Algorithmic Alignment with Cocycles
by: Dudzik, Andrew, et al.
Published: (2023)

Computing finite index congruences of finitely presented semigroups and monoids
by: Anagnostopoulou-Merkouri, Marina, et al.
Published: (2023)

Computation of Jacobi sums of order l^2 and 2l^2 with prime l
by: Ahmed, Md. Helal, et al.
Published: (2019)

Quantum Speedup for Spectral Approximation of Kronecker Products
by: Gao, Yeqi, et al.
Published: (2024)

Functional design of efficient and parallelizable combinatorial generators using convolution
by: He, Xi, et al.
Published: (2025)

Dynamic Spectral Clustering with Provable Approximation Guarantee
by: Laenen, Steinar, et al.
Published: (2024)

Foundational theory for optimal decision tree problems. I. Algorithmic and geometric foundations
by: He, Xi
Published: (2025)

Optimal hypersurface decision trees
by: He, Xi
Published: (2025)

Dynamic Similarity Graph Construction with Kernel Density Estimation
by: Laenen, Steinar, et al.
Published: (2025)

Learning-augmented smooth integer programs with PAC-learnable oracles
by: He, Hao-Yuan, et al.
Published: (2026)

On the Dynamics of Linear Finite Dynamical Systems Over Galois Rings
by: Kantic, Jonas, et al.
Published: (2026)

Algorithmic Problems in Categories of Partitions
by: Faroß, Nicolas, et al.
Published: (2025)

Tensor decomposition beyond uniqueness, with an application to the minrank problem
by: Koiran, Pascal, et al.
Published: (2025)

Insights into $(k,ρ)$-shortcutting algorithms
by: Leonhardt, Alexander, et al.
Published: (2024)

The minimal canonical form of a tensor network
by: Acuaviva, Arturo, et al.
Published: (2022)

Phase transition of the Sinkhorn-Knopp algorithm
by: He, Kun
Published: (2025)

On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport
by: He, Kun
Published: (2026)

Dynamic DBSCAN with Euler Tour Sequences
by: Shin, Seiyun, et al.
Published: (2025)

Dynamic algorithms for k-center on graphs
by: Cruciani, Emilio, et al.
Published: (2023)

Dynamic Correlation Clustering in Sublinear Update Time
by: Cohen-Addad, Vincent, et al.
Published: (2024)

Fully Dynamic Submodular Maximization over Matroids
by: Dütting, Paul, et al.
Published: (2023)

On the query complexity of sampling from non-log-concave distributions
by: He, Yuchen, et al.
Published: (2025)

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
by: Forster, Sebastian, et al.
Published: (2024)

A Dynamic Algorithm for Weighted Submodular Cover Problem
by: Banihashem, Kiarash, et al.
Published: (2024)

Better Models and Algorithms for Learning Ising Models from Dynamics
by: Gaitonde, Jason, et al.
Published: (2025)

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
by: He, Yuchen, et al.
Published: (2024)

Online Sparsification of Bipartite-Like Clusters in Graphs
by: Das, Joyentanuj, et al.
Published: (2025)

Structure-Aware Spectral Sparsification via Uniform Edge Sampling
by: He, Kaiwen, et al.
Published: (2025)

On the Problem of Best Arm Retention
by: Chen, Houshuang, et al.
Published: (2025)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
by: Braverman, Vladimir, et al.
Published: (2024)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
by: Mishra, Nina, et al.
Published: (2025)

Dynamic Algorithm for Explainable k-medians Clustering under lp Norm
by: Makarychev, Konstantin, et al.
Published: (2025)

TimeCluster with PCA is Equivalent to Subspace Identification of Linear Dynamical Systems
by: Hines, Christian L., et al.
Published: (2025)

Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
by: Shakiba, Ali
Published: (2023)

Average Sensitivity of Hierarchical $k$-Median Clustering
by: Li, Shijie, et al.
Published: (2025)