arXiv research

PF-LaCG removes the need for knowing smoothness and strong convexity parameters for locally accelerated CG.

This study considers that the collective route choices of travelers en route represent a resolution of their competition on network routes. Well understanding this competition and coordinating their route choices help mitigate urban traffic congestion. Even though existing studies have developed such mechanisms (e.g., …

We introduce a novel approach for estimating Latent Dirichlet Allocation (LDA) parameters from collapsed Gibbs samples (CGS), by leveraging the full conditional distributions over the latent variable assignments to efficiently average over multiple samples, for little more computational cost than drawing a single addit…

The conjugate gradient (CG) method is an efficient iterative method for solving large-scale strongly convex quadratic programming (QP). In this paper we propose some generalized CG (GCG) methods for solving the $\ell_1$-regularized (possibly not strongly) convex QP that terminate at an optimal solution in a finite numb…

Novel CG-EGNNs learn equivariant functions from Clifford algebras.

New method uses normalizing flows to improve force fields for coarse-grained molecular dynamics.

Any regular Gaussian probability distribution that can be represented by an AMP chain graph (CG) can be expressed as a system of linear equations with correlated errors whose structure depends on the CG. However, the CG represents the errors implicitly, as no nodes in the CG correspond to the errors. We propose in this…

New method speeds up Gaussian process training and inference for large datasets.

Improved CG force-field learning from all-atom data.

In this work, we present direction-of-arrival (DoA) estimation algorithms based on the Krylov subspace that effectively exploit prior knowledge of the signals that impinge on a sensor array. The proposed multi-step knowledge-aided iterative conjugate gradient (CG) (MS-KAI-CG) algorithms perform subtraction of the unwan…

Kaczmarz++ accelerates convergence for ill-conditioned systems.

We define parahoric $\cG$--torsors for certain Bruhat--Tits group scheme $\cG$ on a smooth complex projective curve $X$ when the weights are real, and also define connections on them. We prove that a $\cG$--torsor is given by a homomorphism from $π_1(X\setminus D)$ to a maximal compact subgroup of $G$, where $D\, \subs…

A new diffusion sampling method combines Krylov subspace and diffusion models for faster and more efficient inverse problems.

In this paper we introduce a parameter dependent class of Krylov-based methods, namely CD, for the solution of symmetric linear systems. We give evidence that in our proposal we generate sequences of conjugate directions, extending some properties of the standard Conjugate Gradient (CG) method, in order to preserve the…

New CGMD model predicts non-equilibrium processes better than existing methods.

In this paper, we deal with the problem of marginalization over and conditioning on two disjoint subsets of the node set of chain graphs (CGs) with the LWF Markov property. For this purpose, we define the class of chain mixed graphs (CMGs) with three types of edges and, for this class, provide a separation criterion un…

The paper analyzes and mitigates biases in scalable Gaussian Process methods.

The combination of high-dimensionality and disparity of time scales encountered in many problems in computational physics has motivated the development of coarse-grained (CG) models. In this paper, we advocate the paradigm of data-driven discovery for extract- ing governing equations by employing fine-scale simulation …

Graph neural network predicts optimal coarse-grained mapping operators.

Conjugate gradient (CG) methods are a class of important methods for solving linear equations and nonlinear optimization problems. In this paper, we propose a new stochastic CG algorithm with variance reduction and we prove its linear convergence with the Fletcher and Reeves method for strongly convex and smooth functi…

A new machine-learned CG model predicts protein structures efficiently.

In this work, we consider Corporate Governance (CG) ties among companies from a multiple network perspective. Such a structure naturally arises from the close interrelation between the Shareholding Network (SH) and the Board of Directors network (BD). In order to capture the simultaneous effects of both networks on CG,…

Paper proposes a new method to find approximate SOSP for nonconvex constrained optimization problems.

Proposes a method to use causal graph knowledge for better predictive modeling.

CG-BGs combine flow-based models with PMFs to sample large systems efficiently.

CFA improves model's ability to generalize across unseen domain-class combinations.

Robust CG methods avoid data corruption and solve structured statistical estimation problems.

Garside groupoids, as recently introduced by Krammer, generalise Garside groups. A weak Garside group is a group that is equivalent as a category to a Garside groupoid. We show that any periodic loop in a Garside groupoid $\CG$ may be viewed as a Garside element for a certain Garside structure on another Garside groupo…

We discuss two sorts of generalization of Lie groupoids. One is Lie $n$-groupoids defined as simplicial manifolds with trivial $π_{k\geq n+1}$. The other is the stacky Lie groupoid $\cG\rra M$ with $\cG$ a differentiable stack. We build 1-1 correspondence between Lie 2-groupoids and stacky Lie groupoids up to a certain…

For any triple $(W,L,ρ)$, where W is a closed connected and oriented 3-manifold, L is a link in W and $ρ$ is a flat principal B-bundle over W (B is the Borel subgroup of $SL(2,\mc)$), one constructs a $\Dd$-scissors congruence class $\cG_{\Dd}(W,L,ρ)$ which belongs to a (pre)-Bloch group $\Pp (\Dd)$. The class $\cG_{\D…

CG-EnKF and NS-EnKF outperform deep learning-based SF in data assimilation.

In a modern observational study based on healthcare databases, the number of observations and of predictors typically range in the order of $10^5$ ~ $10^6$ and of $10^4$ ~ $10^5$. Despite the large sample size, data rarely provide sufficient information to reliably estimate such a large number of parameters. Sparse reg…

Conditional gradients constitute a class of projection-free first-order algorithms for smooth convex optimization. As such, they are frequently used in solving smooth convex optimization problems over polytopes, for which the computational cost of orthogonal projections would be prohibitive. However, they do not enjoy …

The paper studies the solution of stochastic optimization problems in which approximations to the gradient and Hessian are obtained through subsampling. We first consider Newton-like methods that employ these approximations and discuss how to coordinate the accuracy in the gradient and Hessian to yield a superlinear ra…

Proposes a new CG interpretation of neural networks for better theoretical analysis.

We demonstrate the breakdown of several fundamentals of Lorentzian causality theory in low regularity. Most notably, chronological futures (defined naturally using locally Lipschitz curves) may be non-open, and may differ from the corresponding sets defined via piecewise $C^1$-curves. By refining the notion of a causal…

Efficient methods for Lévy models using SINH-regular processes.

We show how to construct measures on Banach manifolds associated to supersymmetric quantum field theories. These measures are mathematically well-defined objects inspired by the formal path integrals appearing in the physics literature on quantum field theory. We give three concrete examples of our construction. The fi…

We discuss two generalizations of Lie groupoids. One consists of Lie $n$-groupoids defined as simplicial manifolds with trivial $π_{k\geq n+1}$. The other consists of stacky Lie groupoids $\cG\rra M$ with $\cG$ a differentiable stack. We build a 1-1 correspondence between Lie 2-groupoids and stacky Lie groupoids up to …

The paper examines curvature and stability in quasi-geostrophic motions using spherical harmonics.

A new framework optimizes model transfer across domains with labeled data.

A new iterative K-FAC algorithm reduces training time and memory usage.

Streaming variational Bayes (SVB) is successful in learning LDA models in an online manner. However previous attempts toward developing online Monte-Carlo methods for LDA have little success, often by having much worse perplexity than their batch counterparts. We present a streaming Gibbs sampling (SGS) method, an onli…

We address the problem of causal discovery from data, making use of the recently proposed causal modeling framework of modular structural causal models (mSCM) to handle cycles, latent confounders and non-linearities. We introduce σ-connection graphs (σ-CG), a new class of mixed graphs (containing undirected, bidirected…

Paper proposes a method to find approximate SOSP for nonconvex conic optimization problems.

New constructions from non-separating planar graphs improve understanding of graph linkability and knotability.

Conjugate gradient methods improve efficiency for high-dimensional GLMMs.

We discuss the construction of finite noncommutative geometries on Hopf algebras and finite groups in the `quantum groups approach'. We apply the author's previous classification theorem, implying that calculi in the factorisable case correspond to blocks in the dual, to classify differential calculi on the quantum cod…