Algorithms for Gaussian process, marginal likelihood methods or restricted maximum likelihood methods often require derivatives of log determinant terms. These log determinants are usually parametric with variance parameters of the underlying statistical models. This paper demonstrates that, when the underlying matrix …
The log-determinant of a kernel matrix appears in a variety of machine learning problems, ranging from determinantal point processes and generalized Markov random fields, through to the training of Gaussian processes. Exact calculation of this term is often intractable when the size of the kernel matrix exceeds a few t…
Novel algorithm speeds up log-determinant estimation for large matrices.
problem Efficiently estimating log-determinants of large positive definite matrices under memory constraints.
method Hierarchical algorithm based on block-wise computation of LDL decomposition.
result Accurate estimation of NTK log-determinants from a tiny fraction of the full dataset.
This work presents a parametrized family of divergences, namely Alpha-Beta Log- Determinant (Log-Det) divergences, between positive definite unitized trace class operators on a Hilbert space. This is a generalization of the Alpha-Beta Log-Determinant divergences between symmetric, positive definite matrices to the infi…
The scalable calculation of matrix determinants has been a bottleneck to the widespread application of many machine learning methods such as determinantal point processes, Gaussian processes, generalised Markov random fields, graph models and many others. In this work, we estimate log determinants under the framework o…
New method estimates log-determinant using trace powers, avoiding classical limitations.
problem Estimating log-determinant of large matrices efficiently and accurately.
method Interpolating moment-generating function and its derivative at zero using trace powers.
result No continuous estimator using finite moments can be uniformly accurate over unbounded conditioning.
In this article, we completely determine which log Fano hyperplane arrangements are uniformly K-stable, K-stable, K-polystable, K-semistable or not.
The study examines averages of Laplacian determinants over large genus moduli spaces.
problem Analyzing averages of determinants of Laplacians over large genus moduli spaces.
method Examined the moduli space of hyperbolic surfaces with the Weil-Petersson metric, showing decay rates and approaching constants for specific functions.
result Found a universal constant E and decay rates for expected values of determinants over large genus moduli spaces.
DAGMA learns DAGs faster and more accurately using log-determinant acyclicity.
problem Learning directed acyclic graphs from data efficiently and accurately.
method DAGMA uses M-matrices and log-determinant acyclicity to optimize DAG learning.
result DAGMA achieves faster and more accurate DAG learning compared to existing methods.
Log-symplectic structures are Poisson structures that are determined by a symplectic form with logarithmic singularities. We construct moduli spaces of curves with values in a log-symplectic manifold. Among the applications, we classify symplectically ruled log-symplectic 4 manifolds (both orientable and non-orientab…
Survival strategies in a market with self-determined prices are closely tied to log-optimal investment.
problem Survival of wealth in a market with endogenous prices.
method Assume only one's actions affect prices, use log-optimal strategy, disregard actual prices.
result Survival strategies are asymptotically close to log-optimal strategies.
New method computes affine normal directions efficiently for sparse polynomials.
problem Computing affine normal directions is computationally expensive in high dimensions.
method Reduces third-order tensor contraction to matrix-free formulation using log-determinant gradient.
result Scalable implementations with near-linear scaling in dimension and sparsity.
A new algorithm improves sampling for graph learning models.
problem Euclidean proposals struggle near the boundary of PSD matrices.
method ConeMALA, a geometry-aware Langevin algorithm.
result ConeMALA achieves higher ESS/sec and stable diagnostics.
The paper extends risk measures to two-step approximations and studies log-concave distributions.
problem Extending classical risk measures to two-step approximations.
method Optimization problem for determining optimal regime thresholds and values for log-concave distributions.
result Conditions for the uniqueness of regime changing in log-concave distributions.
The paper connects complex normalizing flows to Kähler-Ricci flows using geometric and statistical perspectives.
problem Understanding the relationship between complex normalizing flows and Kähler-Ricci flows.
method Develops connections between complex normalizing flows and Kähler-Ricci flows by relating the log determinant to Ricci curvature and using a Bayesian perspective.
result Reconciles the complex normalizing flow and Kähler-Ricci flow, showing they are related under certain conditions.
Paper improves efficiency in matrix computations for Gaussian processes.
problem Efficiency in matrix computations for Gaussian processes.
method Variance reduction via matrix factorization.
result Factorized estimator can be up to 1,000 times more efficient.
We compute the log canonical thresholds of non-negatively curved singular hermitian metrics on ample linearized line bundles on bi-equivariant group compactifications of complex reductive groups. To this end, we associate to any such metric a convex function whose asymptotic behavior determines the log canonical thresh…
Let X be a complex manifold with strongly pseudoconvex boundary M. If u is a defining function for M, then -log u is plurisubharmonic on a neighborhood of M in X, and the (real) 2-form s = i \del \delbar(-log u) is a symplectic structure on the complement of M in a neighborhood in X of M; it blows up along M. The Poiss…
The square root of Fredholm determinants causes numerical instabilities in option pricing models.
problem Numerical instabilities in Fourier-based option pricing for the Volterra Stein-Stein model.
method Characterization of determinant crossing behavior, derivation of transform to handle crossings, efficient algorithms.
result Significant improvement in accuracy and reduction in computational cost for Fourier-based pricing.
A new method speeds up training of deep models by avoiding Jacobian determinant computation.
problem Efficiently training deep neural networks with complex log-determinant terms.
method Relative gradients to compute Jacobian updates efficiently.
result Training neural networks with Jacobian log-determinant objectives becomes feasible.
A new coordinate system for SPD matrices simplifies computations and generative modeling.
problem Computing and modeling SPD matrices
method Reverse telescoping coordinate system
result Significantly reduces computational complexity and facilitates generative modeling.
Evaluating the log determinant of a positive definite matrix is ubiquitous in machine learning. Applications thereof range from Gaussian processes, minimum-volume ellipsoids, metric learning, kernel learning, Bayesian neural networks, Determinental Point Processes, Markov random fields to partition functions of discret…
Abstract: Expresses zeta-determinant of Dirichlet-to-Neumann operator on forms.
problem Express zeta-determinant of Dirichlet-to-Neumann operator on forms.
method Expresses zeta-determinant as difference of Laplacian determinants with boundary conditions.
result Computes terms explicitly for dimensions 2 and 3.
Paper introduces VDE, a variance-reduced determinant estimator.
problem Estimating determinants with low variance and efficiency.
method Combines variational inference and spherical normalizing flows.
result VDE achieves zero variance in ideal cases, requiring only one sample.
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…
Develops interpolation methods for matrix functions in statistics and machine learning.
problem Estimating matrix functions in statistics and machine learning.
method Interpolates log-determinant and trace of matrix powers using modified sharp bounds.
result Accuracy and performance demonstrated in numerical examples.
We compute the curvature of the determinant line bundle on a family of Dirac operators for a noncommutative two torus. Following Quillen's original construction for Riemann surfaces and using zeta regularized determinant of Laplacians, one can endow the determinant line bundle with a natural Hermitian metric. By using …
We show that the minimal number of colors for all effective n-colorings of a link with non-zero determinant is at least 1+log2n.
For applications as varied as Bayesian neural networks, determinantal point processes, elliptical graphical models, and kernel learning for Gaussian processes (GPs), one must compute a log determinant of an n×n positive definite matrix, and its derivatives - leading to prohibitive O(n3) computatio…
The Milnor fiber conjecture is proven for splice type singularities.
problem Proving the Milnor fiber conjecture for a specific class of singularities.
method Combining techniques from tropical geometry, log geometry, and rounding of logarithmic spaces.
result The Milnor fiber conjecture is proven for splice type singularities.
Develops a novel framework for pricing variance swaps in multi-asset stochastic volatility models.
problem Pricing variance swaps in multi-asset stochastic volatility models.
method Determinant-based instantaneous generalized variance, Heston and BNS stochastic volatility frameworks.
result Analytical pricing expressions for multi-asset Heston and BNS formulations.
Study uses renormalized area to determine metric expansion from minimal surfaces.
problem Recovering the expansion of asymptotically hyperbolic metrics from minimal surfaces.
method Uses renormalized area functional on minimal submanifolds to recover metric expansion.
result Proves rigidity for log-analytic metrics and determines obstruction tensor.
Study on geometric Jensen-Shannon divergence for Gaussian measures in Hilbert space.
problem Computing divergence between Gaussian measures in infinite-dimensional Hilbert space.
method Closed form expression and regularization for divergence calculation.
result Closed form expression and regularization for Geometric Jensen-Shannon divergence.
Improved Gaussian process regression with tighter log marginal likelihood bounds.
problem Improving predictive performance in Gaussian process regression models.
method Lower bound on log marginal likelihood using conjugate gradients.
result Improved predictive performance compared to other conjugate gradient based approaches.
New algorithm speeds up sampling from log-concave distributions over polytopes.
problem Sampling from log-concave distributions constrained to polytopes efficiently.
method Improved Markov chain with efficient linear solvers and randomized estimators.
result Per-step complexity is nearly optimal, with reduced arithmetic operations.
The paper derives inequalities and formulas for generalized Ricci flow.
problem Understanding and characterizing generalized Ricci flow.
method Using Bochner formula and adapted Malliavin gradient, the paper derives inequalities and characterizes generalized Ricci flow.
result Characterizations of generalized Ricci flow via inequalities for the associated Malliavin gradient.
New algorithm for online portfolio selection with reduced runtime.
problem Maximizing total return in online portfolio selection.
method Minimizes current logarithmic loss regularized by log-determinant of Hessian.
result Achieves regret guarantee similar to Universal Portfolios with reduced runtime.
Differentially private log-location-scale regression models improve privacy in statistical analysis.
problem Ensuring privacy in statistical regression models while maintaining accuracy.
method Integrates differential privacy into LLS regression using the functional mechanism.
result Proposed DP-LLS models satisfy ε-differential privacy and perform well under various conditions.
SGD's escape rate depends on log loss barrier, not linear loss barrier.
problem Understanding the escape rate of SGD from local minima.
method Derived a stochastic differential equation (SDE) with additive noise from SGD's multiplicative noise property.
result The log loss barrier determines the escape rate of SGD, not the linear loss barrier.
The Seiberg-Witten family of elliptic curves defines a Jacobian rational elliptic surface Z over CP1. We show that for the ∂ˉ-operator along the fiber the logarithm of the regularized determinant −1/2logdet′(∂ˉ∗∂ˉ) satisfies the anomaly equation of the …
The volume density of a hyperbolic link K is defined to be the ratio of the hyperbolic volume of K to the crossing number of K. We show that there are sequences of non-alternating links with volume density approaching v8, where v8 is the volume of the ideal hyperbolic octahedron. We show that the…
Data science predicts user interest for midwifery content.
problem Improving midwives' learning and preventing maternal and newborn deaths.
method Forecasting methods using user-generated logs from online learning apps.
result Determining future user interest in midwifery content types.
Paper studies multiclass classifiers from binary classifiers, proving methods and demonstrating advantages.
problem Constructing efficient multiclass classifiers from binary ones.
method Two methods: one vs. all and hierarchical classification, with a new leverage-hierarchical method introduced.
result Proves upper bounds and exact formulas for multiclass regret in terms of binary regrets.
New non-Kähler 3-folds constructed via log conifold transitions.
problem Constructing new non-Kähler 3-folds from Fano threefold pairs.
method Defining log conifold transitions and studying their deformation theory.
result Local smoothings of nodes can be lifted to global first-order deformations.
Bayesian inference and superstatistics model financial volatility dynamics across different timescales.
problem Modeling correlated volatility in financial time series with heavy tails and long memory.
method Superstatistical dynamics, Bayesian Inference, Metropolis-Hasting sampling.
result The log-Normal model is reliable for short timescales, while inverse-Gamma is preferred for long timescales.
The paper improves support recovery in high-dimensional precision matrix estimation using meta learning.
problem Support recovery in high-dimensional precision matrix estimation with reduced sample complexity.
method Pooling samples from different tasks and using an improper ℓ1-regularized log-determinant Bregman divergence to estimate a single precision matrix. result The support of the improperly estimated single precision matrix is equal to the true support union with high probability.
A new method combines online and offline learning to tackle contextual bandits with missing action support.
problem Learning optimal policies with logged data when the logging policy has deficient support.
method Hybrid approach using online exploration to exploit supported actions and offline learning to avoid unnecessary explorations.
result Determines an optimal policy with theoretical guarantees using minimal online explorations.
This paper detects anomalies in cellular network traffic using hybrid methods.
problem Detecting anomalies in network traffic for security and analysis.
method Hybrid method combining GARCH, K-means, and Neural Network.
result Anomaly detection in cellular network traffic successfully achieved.