Unified approach to studying hyperbolic groups using stable subspaces and Morse boundaries.
problem Understanding the geometric and algebraic properties of hyperbolic groups.
method Unified approach to viewing geodesic metric spaces as unions of stable subspaces, using quasi-convex subsets and direct limits of Gromov boundaries.
result Unified understanding of stable subgroups and Morse boundaries, leading to new quasi-isometry invariant dimensions.
Paper introduces S-SSE for stable sparse subspace embedding.
problem Inefficient sparse random projection matrices with uneven non-zero distribution.
method Uses uniform sampling without replacement to create a stable sparse subspace embedded matrix (S-SSE).
result S-SSE maintains Euclidean distance better after dimension reduction.
In this paper, we study Conley theory in Hilbert spaces and make some refinement of the construction of the stable Conley index developed by Gȩba, Izydorek, and Pruszko. For instance, we allow subspaces other than invariant subspaces in the the construction. As a main result, we show that the resulting stable Conley in…
The study restricts stable minimal immersions in product spaces to specific configurations.
problem Prohibiting stable minimal immersions in certain product spaces.
method Analyzing stable minimal immersions in products of complex, quaternionic, and octonionic projective spaces.
result The only stable compact minimal immersions in the product of a quaternionic projective space with any other Riemannian manifold are the products of quaternionic projective subspaces with compact stable minimal immersions of the second manifold.
Study non-asymptotic bounds on correlation in high-dimensional linear systems, revealing invariant subspaces and bottlenecks.
problem Understanding correlation and mixing in high-dimensional linear systems with Gaussian noise.
method Sampling from sub-trajectories, using Talagrand's inequality, and analyzing invariant subspaces.
result Large discrepancy between algebraic and geometric multiplicity leads to bottlenecks between invariant subspaces.
The stable 4-genus of a knot K in 3-space is the limiting value of g_4(nK)/n, where g_4 denotes the 4-genus and n goes to infinity. This induces a seminorm on CQ, the concordance group tensored with the rational numbers. Basic properties of the stable genus are developed, as are examples focused on understanding the un…
The paper proves conditions for minimal surfaces to be holomorphic and stable.
problem Conditions for stable minimal surfaces to be holomorphic.
method Developed a method of constructing variations to prove the equivalence.
result Holomorphicity and stability conditions for minimal surfaces.
The paper improves conditions for unique recovery in homomorphic sensing of subspaces.
problem Unique recovery of points in a linear subspace from their images under linear maps.
method Tighter and simpler conditions for unique recovery in single and subspace arrangement cases, extending to noise stability.
result Conditions for unique recovery in homomorphic sensing are improved and unified.
Fast and stable domain adaptation method using low-rank subspaces.
problem Improving generalization across domain boundaries in unsupervised learning.
method Calculates a single domain invariant subspace in closed form using low-rank techniques.
result Remarkable performance across various domain adaptation tasks.
We prove, using the subspace embedding guarantee in a black box way, that one can achieve the spectral norm guarantee for approximate matrix multiplication with a dimensionality-reducing map having m=O(r~/ε2) rows. Here r~ is the maximum stable rank, i.e. squared ratio of Frobenius and op…
By only using spectral theory of the Laplace operator on spheres, we prove that the unit 3-dimensional sphere of a 2-dimensional complex subspace of C3 is a Ω-stable submanifold with parallel mean curvature, when Ω is the Kähler calibration of rank 4 of C3.
Shows CM line bundles are ample on K-stable varieties.
problem Ensuring CM line bundles are ample on K-stable varieties.
method Analyzes CM line bundles on K-stable varieties and their families.
result CM line bundles are ample on K-stable varieties with maximal variation.
Constructs a Morse-Bott function on symplectic Grassmannians.
problem Defines a function on symplectic Grassmannians.
method Uses a compatible linear complex structure to construct a quadratic Morse-Bott function.
result Critical loci consist of subspaces splitting into isotropic and complex parts.
In this paper we provide some stability criteria for systems of linear subspaces of V⊗W and for systems of quotient coherent sheaves, using, respectively, the Hilbert-Mumford numerical criterion and moment map. Along the way, we generalize the Gelfand-MacPherson correspondence [11] from point sets to sets of …
Paper improves robust subspace clustering for noisy and missing data.
problem Clustering points on multiple subspaces with noise and missing data.
method Robust variant of sparse subspace clustering (SSC) with explicit noise and missing data tolerance bounds.
result Establishes clustering guarantees for higher tolerance to noise and missing data.
Study chord diagrams and knot theory, proving inevitable complexity in cohomology sequences.
problem Understanding the complexity in knot theory through chord diagrams and cohomology.
method Analyzing systems of equality conditions and their subspaces in vector spaces.
result Inevitable presence of non-stable terms in spectral sequences of knot cohomology.
Paper refines Mean Shift for stable density ridges, proving convergence to new geometric structure.
problem Theoretical mismatch between static and dynamic density ridges in SCMS.
method Introduces stable ridge, proves its convergence, and develops generalized SCMS framework.
result SCMS converges to stable ridge, providing a more accurate representation of data.
Stability result for nearly isometric subspaces and Finsler surfaces.
problem Stability of normed spaces and Finsler surfaces under near-isometric conditions.
method Refined topological argument and explicit quantification using Banach-Mazur distance.
result A 2-dimensional surface with near-monochromatic Finsler metric is approximately Riemannian.
New Krylov subspace methods speed up mixed-effects models with crossed random effects.
problem Slow computations for high-dimensional crossed random effects in mixed-effects models.
method Krylov subspace-based methods for generalized mixed-effects models with cross effects.
result Speedups by factors of up to 10,000 in computations for mixed-effects models.
A scalable Gaussian process method for large datasets.
problem Handling high number of training instances and high dimensional input data.
method Subspace inducing inputs combined with matrix-preconditioning.
result Improved predictive performances and reduced computational times.
This article deals with two topics: the first, which has a general character, is a variation formula for the the determinant line bundle in non-Kählerian geometry. This formula, which is a consequence of the non-Kählerian version of the Grothendieck-Riemann Roch theorem proved recently by Bismut, gives the variation of…
We prove a spectral flow formula for one-parameter families of Hamiltonian systems under homoclinic boundary conditions, which relates the spectral flow to the relative Maslov index of a pair of curves of Lagrangians induced by the stable and unstable subspaces, respectively. Finally, we deduce sufficient conditions fo…
Classifies stable hypersurfaces in real projective spaces and confirms the isoperimetric conjecture.
problem Volume preserving stability and isoperimetric problem in real projective spaces.
method Classification of stable hypersurfaces and analysis of antipodal invariant hypersurfaces.
result Solutions of the isoperimetric problem are tubular neighborhoods of projective subspaces.
Sparse representations using learned dictionaries are being increasingly used with success in several data processing and machine learning applications. The availability of abundant training data necessitates the development of efficient, robust and provably good dictionary learning algorithms. Algorithmic stability an…
The study examines stable minimal surfaces in higher dimensions and provides bounds on their properties.
problem Properties of stable minimal surfaces in higher codimension.
method Structural analysis of holomorphic vector bundles and geometric inequalities.
result Explicit bounds on the systole for stable minimal tori and surfaces.
Geometric Invariant Theory applied to Kähler manifolds yields analytic models for vector bundles.
problem Constructing local models for vector bundles on Kähler manifolds.
method Applying Geometric Invariant Theory to Kähler manifolds to construct analytic GIT-quotients.
result Existence of Weil-Petersson forms on parameter spaces for stable vector bundles.
Randomly shuffled kernels can be compressed efficiently.
problem Reducing storage cost of CNN parameters on resource-limited platforms.
method Randomly-shuffled tensor decomposition (RsTD) to embed kernels into random low-rank subspaces.
result CNNs can be significantly compressed even with randomly shuffled kernels, achieving more stable accuracy.
We introduce the anti-profile Support Vector Machine (apSVM) as a novel algorithm to address the anomaly classification problem, an extension of anomaly detection where the goal is to distinguish data samples from a number of anomalous and heterogeneous classes based on their pattern of deviation from a normal stable c…
Paper proposes CLAIR for efficient LLM fine-tuning across clients.
problem Fine-tuning large language models (LLMs) efficiently and collaboratively.
method Federated LoRA fine-tuning with Collaborative Low-rank Alignment and Identifiable Recovery (CLAIR).
result CLAIR achieves better performance and contamination detection compared to local fine-tuning.
Study proves a space of manifolds is homology equivalent to a loop space.
problem Understanding the stable moduli space of certain high-dimensional manifolds.
method Incorporates surgery data via Lagrangian subspaces in a cobordism category.
result The stable moduli space is homology equivalent to an infinite loopspace.
The paper establishes a Miyaoka-Yau type inequality for hyperplane arrangements in complex projective space.
problem Finding a lower bound for the total sum of multiplicities of codimension 2 intersection subspaces of a hyperplane arrangement.
method Using a quadratic form defined by the intersection poset of the hyperplane arrangement, and applying the Bogomolov-Gieseker inequality for parabolic bundles.
result The inequality Q(a,…,a)≤0 gives a lower bound for the total sum of multiplicities of codimension 2 intersection subspaces of the hyperplane arrangement, with equality conditions provided. The ECME algorithm has proven to be an effective way of accelerating the EM algorithm for many problems. Recognising the limitation of using prefixed acceleration subspace in ECME, we propose the new Dynamic ECME (DECME) algorithm which allows the acceleration subspace to be chosen dynamically. Our investigation of an …
We introduce a method to construct G2-instantons over compact G2-manifolds arising as the twisted connected sum of a matching pair of building blocks [Kov03,KL11,CHNP12]. Our construction is based on gluing G2-instantons obtained from holomorphic bundles over the building blocks via the first named author's wo…
Algorithm fine-tunes multi-view weights for streaming data.
problem Streaming data in multi-view learning.
method Fine-tuning combination weights of stable subspaces.
result Algorithm effectively handles streaming views.
A new method routes EEG covariance matrices across domains using adaptive subspace selection.
problem Challenges in cross-domain EEG decoding due to distinct SPD manifold regions.
method Dynamic Stiefel routing with expert filters and cross-attention for adaptive subspace projection.
result Consistent gains across three datasets: balanced accuracy improves from 0.773 to 0.823, 0.757 to 0.809, and 0.801 to 0.839.
Robust fuzzy clustering for EEG driver alertness with outlier detection.
problem Ambiguous state boundaries in multivariate time series data.
method RFCPCA, a robust fuzzy subspace-clustering method for MTS.
result RFCPCA improves clustering accuracy and characterizes uncertainty and outliers in MTS.
We study a natural map from representations of a free group of rank g in GL(n,C), to holomorphic vector bundles of degree 0 over a compact Riemann surface X of genus g, associated with a Schottky uniformization of X. Maximally unstable flat bundles are shown to arise in this way. We give a necessary and sufficient cond…
The paper shows how to stabilize off-policy reinforcement learning using specific state representations.
problem Stability issues in reinforcement learning with function approximation and off-policy learning.
method Formal analysis of representation learning schemes based on the transition matrix of a policy.
result Schur and orthogonal bases of the Krylov subspace provide stable representations for TD learning.
iSearch uses innovation directions for robust PCA and outlier detection.
problem Robust PCA and outlier detection in data with outliers.
method iSearch uses innovation directions to compute optimal data points and identify outliers.
result iSearch provides robust PCA and outlier detection with performance guarantees.
New method aligns diffusion models for inference-time properties without retraining.
problem Aligning pre-trained diffusion models for desired inference-time properties.
method Variationally stable Doob's matching for provable guidance estimation.
result Consistent estimator of guidance with non-asymptotic convergence guarantees.
Study investigates non-Kahler Ricci flow singularities converging to Kahler-Ricci solitons.
problem Investigating finite-time Type-I singularities in non-Kahler Ricci flow solutions.
method Examining the convergence of parabolic rescalings at singularities to shrinking Kahler-Ricci solitons.
result Supports the conjecture that the blowdown soliton is stable under Ricci flow and the subspace of Kahler metrics is stable under Ricci flow.
Paper introduces efficient methods for estimating cross-partial derivatives and sensitivity indices.
problem Efficiently estimating cross-partial derivatives and sensitivity indices in complex models.
method Using randomized points and constraints, the paper develops estimators with optimal convergence rates and low bias.
result The estimators achieve optimal rates of convergence and do not suffer from the curse of dimensionality.
The paper proves a CM line bundle is ample on K-moduli spaces.
problem Proving positivity of the CM line bundle on K-moduli spaces.
method Developed a new invariant for filtrations to test K-stability.
result Proves the CM line bundle is ample on reduced uniformly K-stable Fano varieties.
Paper uses random projection to preserve subspace structure for efficient data analysis.
problem Efficiently analyzing data with low-dimensional structure.
method Compressed Subspace Learning (CSL) framework based on Johnson-Lindenstrauss property.
result Random projection preserves the UoS structure of data, enabling efficient analysis.
This paper covers robust subspace learning and tracking methods.
problem Learning and tracking subspaces in the presence of outliers.
method Robust PCA, Robust Subspace Tracking, Robust Subspace Recovery.
result Effective methods for handling outliers in subspace learning and tracking.
Detects missing tensor signals in a KS subspace with high probability.
problem Detecting tensor signals with many missing entities in a KS subspace.
method Projecting the signal onto the KS subspace and bounding residual energy.
result Reliable detection is possible if the missing signal cardinality exceeds KS subspace dimensions.
In his PhD thesis, Abrams proved that, for a natural number n and a graph G with at least n vertices, the n-strand configuration space of G deformation retracts to a compact subspace, the discretized n-strand configuration space, provided G satisfies two conditions: each path between distinct essential vertices (vertic…
We obtain sharp estimates on the growth rate of stable commutator length on random (geodesic) words, and on random walks, in hyperbolic groups and groups acting nondegenerately on hyperbolic spaces. In either case, we show that with high probability stable commutator length of an element of length n is of order $n/\l…