Kernel clustering algorithm improved for large datasets using incomplete Cholesky factorization.
problem Large memory usage in kernel-based clustering for large-scale datasets.
method Approximate the kernel matrix using incomplete Cholesky factorization and apply linear k-means clustering. result The proposed method achieves similar performance to kernel k-means clustering but handles large-scale datasets efficiently. A new method for efficient causal structure learning at scale.
problem Causal structure learning is computationally challenging at scale.
method Relaxed sparsest-permutation formulation with support-level relaxation and masked zero-fill incomplete Cholesky factorization.
result The method enables scalable comparison of candidate orderings and matches the accuracy of slower baselines.
Paper proposes a new method for sparse covariance Cholesky factor estimation.
problem Estimating sparse covariance matrices for ordered data.
method Matrix loss penalization approach for sparse Cholesky factor estimation.
result The proposed method outperforms existing regression-based approaches in simulations and real data.
Method regularizes Cholesky factors to detect nonstationarity in longitudinal data.
problem Detecting nonstationarity in large covariance matrices of longitudinal data.
method Fused-Lasso regularization on Cholesky factors.
result Regularization leads to smooth subdiagonals, indicating nonstationarity.
This paper develops a fast algorithm for solving nonlinear PDEs using sparse Cholesky factorization.
problem Efficiently solving nonlinear PDEs with Gaussian processes and kernel methods.
method Sparse Cholesky factorization for near-linear complexity.
result Near-linear complexity algorithm for working with kernel matrices of nonlinear PDEs.
Paper proposes a fast algorithm to recover causal DAGs with latent variables.
problem Discovering causal relationships in the presence of latent variables.
method Cholesky factorization of covariance matrix with optimization for latent variables.
result The algorithm significantly outperforms previous methods in synthetic and real-world datasets.
Solving systems of linear equations is a problem occuring frequently in water engineering applications. Usually the size of the problem is too large to be solved via direct factorization. One can resort to iterative approaches, in particular the conjugate gradients method if the matrix is symmetric positive definite. P…
A new method learns DAGs from Gaussian data without verifying acyclicity.
problem Learning DAGs from Gaussian data without verifying acyclicity.
method Relaxation technique for permutation matrix estimation and cyclic coordinatewise descent for sparse Cholesky factor estimation.
result The method recovers DAGs without verifying acyclicity constraints.
New SPD metrics improve stability and efficiency in neural networks.
problem Designing stable and efficient Riemannian metrics on SPD manifolds.
method Cholesky decomposition to derive SPD metrics.
result Proposed metrics provide closed-form operators, computational efficiency, and improved numerical stability.
The paper explores Cholesky decompositions for symmetric matrices and their geometric properties.
problem Understanding the structure and properties of symmetric matrices through Cholesky decompositions.
method Introducing cones of symmetric matrices, proving Cholesky-type factorizations, and showing geometric properties.
result Each symmetric matrix admits an uncountable family of Cholesky-type factorizations, and these cones are isometric Riemannian manifolds.
RPCholesky approximates kernel matrices with few evaluations.
problem Approximating kernel matrices efficiently.
method Randomly pivoted partial Cholesky factorization.
result RPCholesky provides nearly optimal low-rank approximations.
The modified Cholesky decomposition is commonly used for precision matrix estimation given a specified order of random variables. However, the order of variables is often not available or cannot be pre-determined. In this work, we propose to address the variable order issue in the modified Cholesky decomposition for sp…
In this paper, we present a general, multistage framework for graphical model approximation using a cascade of models such as trees. In particular, we look at the problem of covariance matrix approximation for Gaussian distributions as linear transformations of tree models. This is a new way to decompose the covariance…
This paper proposes the recursive and square-root BLS algorithms to improve the original BLS for new added inputs, which utilize the inverse and inverse Cholesky factor of the Hermitian matrix in the ridge inverse, respectively, to update the ridge solution. The recursive BLS updates the inverse by the matrix inversion…
New algorithm extends Greville's method for partitioned matrices efficiently and stably.
problem Efficiently compute pseudoinverse of partitioned matrices without retraining.
method Incorporates inverse Cholesky factorization to reduce computational complexity and improve stability.
result 1 iteration to compute pseudoinverse of whole matrix from first part, addressing all cases.
We demonstrate an equivalence between reproducing kernel Hilbert space (RKHS) embeddings of conditional distributions and vector-valued regressors. This connection introduces a natural regularized loss function which the RKHS embeddings minimise, providing an intuitive understanding of the embeddings and a justificatio…
We present a new Riemannian metric, termed Log-Cholesky metric, on the manifold of symmetric positive definite (SPD) matrices via Cholesky decomposition. We first construct a Lie group structure and a bi-invariant metric on Cholesky space, the collection of lower triangular matrices whose diagonal elements are all posi…
New quadrature method using randomly pivoted Cholesky outperforms existing techniques.
problem Efficiently approximating integrals of functions in reproducing kernel Hilbert spaces.
method Nodes drawn by randomly pivoted Cholesky algorithm.
result Randomly pivoted Cholesky quadrature is fast and achieves comparable accuracy to more computationally intensive methods.
The original Broad Learning System (BLS) on new added nodes and its existing efficient implementation both assume the ridge parameter lambda -> 0 in the ridge inverse to approximate the generalized inverse, and compute the generalized inverse solution for the output weights. In this paper, we propose two ridge solution…
New method differentiates square-root Kalman filters robustly.
problem Gradient calculation issues in square-root Kalman filters.
method Closed-form chain rule derived from Gramian identity, resolves non-orthogonal and rank-deficient issues.
result Robust automatic differentiation for Kalman filters, resolving numerical stability and gradient issues.
PEARL uses reinforcement learning to improve matrix preconditioners.
problem Learning effective preconditioners for iterative solvers is challenging.
method PEARL employs an actor-critic reinforcement learning framework to learn preconditioners dynamically.
result PEARL outperforms traditional and neural preconditioners in flexibility and solving speed.
We address the issue of knots selection for Gaussian predictive process methodology. Predictive process approximation provides an effective solution to the cubic order computational complexity of Gaussian process models. This approximation crucially depends on a set of points, called knots, at which the original proces…
A new criterion HBIC improves model selection for factor analysis with missing data.
problem Model selection for factor analysis with incomplete data.
method Proposes a novel criterion HBIC that uses actual observed information in the penalty term.
result HBIC is more accurate than BIC when missing data rates are high.
Bayesian networks are a class of popular graphical models that encode causal and conditional independence relations among variables by directed acyclic graphs (DAGs). We propose a novel structure learning method, annealing on regularized Cholesky score (ARCS), to search over topological sorts, or permutations of nodes,…
We consider multi-task regression models where observations are assumed to be a linear combination of several latent node and weight functions, all drawn from Gaussian process (GP) priors that allow nonzero covariance between grouped latent functions. We show that when these grouped functions are conditionally independ…
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 new method for efficient Gaussian process inference using sparse approximations.
problem Scalable and accurate inference for latent Gaussian processes.
method Variational approximation with sparse inverse Cholesky factors and double Kullback-Leibler minimization.
result The proposed method can achieve highly accurate approximations with polylogarithmic time complexity.
New method for geodesics of multivariate normals, derived from a Toda lattice.
problem Computing geodesics of multivariate normal distributions.
method Using block Cholesky decomposition and a natural Riemannian submersion, a new Toda lattice type Lax pair is derived.
result A new Toda lattice type Lax pair derived from geodesics and block Cholesky decomposition.
This paper optimizes portfolio management in incomplete markets with stochastic factors, considering periodic wealth evaluations.
problem Optimizing portfolio performance in an incomplete market model with stochastic factors and periodic wealth evaluations.
method Developed a martingale duality approach to find optimal portfolio processes and dual minimizers.
result Established the existence of optimal portfolio processes and identified dual minimizers as the 'least favorable' market completion.
Accelerated RPCholesky speeds up kernel matrix approximations.
problem Efficiently approximating large kernel matrices.
method Accelerated randomly pivoted Cholesky (RPCholesky) with block matrix computations and rejection sampling.
result Approximates kernel matrices up to 40 times faster.
Develops a statistical model for SOFR term structure in incomplete markets.
problem Incomplete liquidity and completeness in SOFR derivatives market.
method Statistical model incorporating macroeconomic factors and jumps in SOFR rates.
result Model is well-suited for risk management and derivatives pricing.
In an incomplete market, with incompleteness stemming from stochastic factors imperfectly correlated with the underlying stocks, we derive representations of homothetic (power, exponential and logarithmic) forward performance processes in factor-form using ergodic BSDE. We also develop a connection between the forward …
Study tackles nonlinear factor models with unknown monotone links from incomplete and noisy data.
problem Learning nonlinear factor models with unknown monotone links from incomplete and noisy data.
method Formulated as joint recovery of low-rank factors, loadings, and nonlinear link function; proposed BCD algorithm with regularization.
result Established convergence guarantees and sublinear regret bounds for link-function updates.
Develops a fast algorithm for fitting multilevel factor models.
problem Fitting multilevel factor models with covariance structure.
method Novel expectation-maximization algorithm tailored for multilevel factor models.
result Shows efficient computation of inverse of positive definite MLR matrix.
Improved aircraft structure prediction using derivative-enhanced sparse Cholesky GP method.
problem Accurate real-time prediction of aircraft structure performance.
method Combining derivative data with a modified dynamic sparse Cholesky linear system solver.
result Improved prediction accuracy of aircraft structure performance.
This paper solves hedging in incomplete markets using neural networks.
problem Hedging in incomplete markets with risk factor, illiquidity, and discrete transaction dates.
method Proposes a jump-diffusion model and uses RNN, LSTM, and Mogrifier-LSTM neural networks for hedging strategies.
result Mogrifier-LSTM is the fastest and most effective model for hedging.
SG-NTF completes HDI tensors with spectral mapping and spatio-temporal gating.
problem High-dimensional and incomplete tensor completion.
method Spectra-Guided Neural Tucker Factorization (SG-NTF) with Spatio-Temporal Co-Gating (STCG).
result Maintains competitive completion accuracy with parameter efficiency.
NeuralIF uses neural networks to improve preconditioning for faster CG convergence.
problem Improving convergence of conjugate gradient method for large-scale sparse systems.
method Data-driven approach using graph neural networks to generate incomplete factorization.
result Data-driven preconditioners accelerate convergence of conjugate gradient method.
Paper presents a method for estimating long-term PDs with incomplete data.
problem Estimating long-term PDs with limited and incomplete historical data.
method Single risk factor approach for simultaneous calibration of PDs across sub-portfolios.
result Method yields long-term PDs without requiring complete historical data.
PEER tackles multi-response regression with incomplete outcomes efficiently.
problem Challenges in estimating, predicting, and computing with large-scale multi-response regression and incomplete outcomes.
method PEER converts multi-response regression into parallel univariate-response regressions.
result PEER achieves consistency in estimation, prediction, and variable selection.
GFA model uncovers brain-behavior associations in incomplete data sets.
problem Incomplete data sets and lack of robust statistical inferences.
method Hierarchical Bayesian model that handles missing data and models modality-specific associations.
result GFA identified four relevant shared factors and predicted non-imaging measures from brain connectivity.
Robustly estimates mean in incomplete data with corrupted examples.
problem Estimating mean in data with missing values and outliers.
method Algorithms for robust estimation with optimal error guarantees in nearly-linear time.
result Information-theoretically optimal error guarantees for mean estimation.
We observe that gradients computed via the reparameterization trick are in direct correspondence with solutions of the transport equation in the formalism of optimal transport. We use this perspective to compute (approximate) pathwise gradients for probability distributions not directly amenable to the reparameterizati…
A new method speeds up Bayesian Optimization for hyperparameter tuning.
problem Efficient hyperparameter tuning for machine learning models.
method Lazy Gaussian Processes approximation to reduce cubic complexity to quadratic.
result Significant speedup in Bayesian Optimization, up to 162x in single node.
We consider the problem of learning a Gaussian variational approximation to the posterior distribution for a high-dimensional parameter, where we impose sparsity in the precision matrix to reflect appropriate conditional independence structure in the model. Incorporating sparsity in the precision matrix allows the Gaus…
We propose an algorithmic framework for convex minimization problems of a composite function with two terms: a self-concordant function and a possibly nonsmooth regularization term. Our method is a new proximal Newton algorithm that features a local quadratic convergence rate. As a specific instance of our framework, w…
We propose some machine-learning-based algorithms to solve hedging problems in incomplete markets. Sources of incompleteness cover illiquidity, untradable risk factors, discrete hedging dates and transaction costs. The proposed algorithms resulting strategies are compared to classical stochastic control techniques on s…
Real data are often with multiple modalities or from multiple heterogeneous sources, thus forming so-called multi-view data, which receives more and more attentions in machine learning. Multi-view clustering (MVC) becomes its important paradigm. In real-world applications, some views often suffer from instances missing…