Advances in Computational Methods for Complex Systems

The field of computational methods for complex systems is rapidly evolving, with a focus on developing innovative techniques for solving large-scale problems. Recent research has emphasized the importance of uncertainty quantification, spectral learning, and nonlinear compressive sensing. Notably, new algorithms have been proposed for solving diagonally dominant systems, Kronecker power matrices, and probabilistic reformulations of regularization techniques. These advances have significant implications for applications in safety-critical domains, such as medical diagnosis and engineering design optimization.

Some noteworthy papers in this area include: Additive Approximation Schemes for Low-Dimensional Embeddings, which provides the first polynomial-time additive approximation scheme for the k-Euclidean Metric Violation problem. Bayesian Parametric Matrix Models: Principled Uncertainty Quantification for Spectral Learning, which introduces a principled framework for uncertainty quantification in spectral learning. Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum, which improves circuit constructions for computing depth-2 linear transforms defined by Kronecker power matrices.

Sources

Characterization of the near-null error components utilized in composite adaptive AMG solvers

Additive Approximation Schemes for Low-Dimensional Embeddings

Uncertainty-Aware Tabular Prediction: Evaluating VBLL-Enhanced TabPFN in Safety-Critical Medical Data

Bi-fidelity Interpolative Decomposition for Multimodal Data

Bayesian Parametric Matrix Models: Principled Uncertainty Quantification for Spectral Learning

Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model

Concentration inequalities for semidefinite least squares based on data

Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum

Probabilistic and nonlinear compressive sensing

Built with on top of