arXiv research

Study improves queue length estimation from connected vehicles by filtering parameters.

Estimation of reliable whole-brain connectivity is a crucial step towards the use of connectivity information in quantitative approaches to the study of neuropsychiatric disorders. When estimating brain connectivity a challenge is imposed by the paucity of time samples and the large dimensionality of the measurements. …

Improved graph-based connectivity estimation using heat modelling.

Method estimates network connectivity and dimensionality from multiple networks.

In this paper, we develop connections between two seemingly disparate, but central, models in robust statistics: Huber's epsilon-contamination model and the heavy-tailed noise model. We provide conditions under which this connection provides near-statistically-optimal estimators. Building on this connection, we provide…

eDCF estimates intrinsic dimension using local connectivity.

We show a connection between the Fourier spectrum of Boolean functions and the REINFORCE gradient estimator for binary latent variable models. We show that REINFORCE estimates (up to a factor) the degree-1 Fourier coefficients of a Boolean function. Using this connection we offer a new perspective on variance reduction…

New proof of injectivity for broken non-abelian X-ray transform in Minkowski space.

This expository article introduces the Kapustin-Witten equations to mathematicians. We discuss the connections between the Complex Yang-Mills equations and the Kapustin-Witten equations. In addition, we show the relation between the Kapustin-Witten equations, the moment map condition and the gradient Chern-Simons flow.…

This paper improves deep neural network approximation for fully connected networks, achieving optimal convergence rates.

The clusters of a distribution are often defined by the connected components of a density level set. However, this definition depends on the user-specified level. We address this issue by proposing a simple, generic algorithm, which uses an almost arbitrary level set estimator to estimate the smallest level at which th…

Study analyzes error in ReLU networks with local connections.

In this paper, a frequency coefficient based on the Sen-Shorrocks-Thon (SST) poverty index notion is proposed. The clustering SST index can be used as the method for determination of the connection between similar neighbor sub-clusters. Consequently, connections can reveal existence of natural homogeneous. Through esti…

The paper explores quantum statistical manifolds and their autoparallelity, providing estimation-theoretical characterizations.

Connectivity estimation is challenging in the context of high-dimensional data. A useful preprocessing step is to group variables into clusters, however, it is not always clear how to do so from the perspective of connectivity estimation. Another practical challenge is that we may have data from multiple related classe…

We consider the distributional connection between the lossy compressed representation of a high-dimensional signal $X$ using a random spherical code and the observation of $X$ under an additive white Gaussian noise (AWGN). We show that the Wasserstein distance between a bitrate-$R$ compressed version of $X$ and its obs…

We prove a conformally invariant estimate for the index of Schrödinger operators acting on vector bundles over four-manifolds, related to the classical Cwikel-Lieb-Rozenblum estimate. Applied to Yang-Mills connections we obtain a bound for the index in terms of its energy which is conformally invariant, and captures th…

Due to the limited resources and the scale of the graphs in modern datasets, we often get to observe a sampled subgraph of a larger original graph of interest, whether it is the worldwide web that has been crawled or social connections that have been surveyed. Inferring a global property of the original graph from such…

A linear non-Gaussian structural equation model called LiNGAM is an identifiable model for exploratory causal analysis. Previous methods estimate a causal ordering of variables and their connection strengths based on a single dataset. However, in many application domains, data are obtained under different conditions, t…

Optimistic estimate predicts best fitting performance of nonlinear models.

Improved method for numerical conformal mappings on complex domains.

Paper proves stability for recovering connections from holonomy traces.

SpINNEr uses matrix regression to analyze brain connectivity, improving accuracy over other methods.

Researchers found a quadratic estimate for embedding higher-dimensional simplices into sphere-connected sums.

Efficiently estimates neural connectivity using ensemble stimulation.

New estimates show all stable Einstein manifolds are linear stable with respect to Perelman's ν-entropy.

Estimates time-varying network connections using multi-stage smoothing.

The concept of a conformal deformation has two natural extensions: quasiconformal and harmonic mappings. Both classes do not preserve the conformal type of the domain, however they cannot change it in an arbitrary way. Doubly connected domains are where one first observes nontrivial conformal invariants. Herbert Groetz…

A simple thresholding technique improves graph selection in neural connectivity studies.

Estimates neuronal connectivity from spike times using flexible Hawkes processes.

A result (Corollary 4.3) in an article by Uhlenbeck (1985) asserts that the $W^{1,p}$-distance between the gauge-equivalence class of a connection $A$ and the moduli subspace of flat connections $M(P)$ on a principal $G$-bundle $P$ over a closed Riemannian manifold $X$ of dimension $d\geq 2$ is bounded by a constant ti…

Estimates parameters of interconnected linear systems using total variation penalization.

Proposes a method to cluster fMRI data and estimate brain connectivity networks.

We study the connections between spectral clustering and the problems of maximum margin clustering, and estimation of the components of level sets of a density function. Specifically, we obtain bounds on the eigenvectors of graph Laplacian matrices in terms of the between cluster separation, and within cluster connecti…

In this paper, we consider three typical problems on a locally finite connected graph. The first one is to study the Bochner formula for the Laplacian operator on a locally finite connected graph. We use the Bochner formula to derive the Bernstein type estimate of the heat equation. The second is to derive the Reilly t…

We find lower and upper bounds for the risk of estimating a manifold in Hausdorff distance under several models. We also show that there are close connections between manifold estimation and the problem of deconvolving a singular measure.

New method estimates neuronal connectivity from partially observed data.

PULSE estimator improves prediction in causal inference with bounded interventions.

Deep neural networks estimate regression functions on manifolds.

We prove some estimates of the volumes of the sets of translation surfaces of unit area having several independent small saddle connections in a rank one affine submanifold.

In this paper we prove a new matrix Li-Yau-Hamilton estimate for Kähler-Ricci flow. The form of this new Li-Yau-Hamilton estimate is obtained by the interpolation consideration originated in \cite{Ch1}. This new inequality is shown to be connected with Perelman's entropy formula through a family of differential equalit…

Paper connects Plackett-Luce and Cox models for preference estimation.

We show how the amplitude of holonomies on a vector bundle can be controlled by the integral of the curvature of the connection on a surface enclosed by the curve.

New framework for dense weighted networks with community-specific patterns.

In this article, we analyze the SPICE method developed in [1], and establish its connections with other standard sparse estimation methods such as the Lasso and the LAD-Lasso. This result positions SPICE as a computationally efficient technique for the calculation of Lasso-type estimators. Conversely, this connection i…

The paper defines surface area for graphs and derives spectral estimates.

Paper proves curvature estimate for curved spaces.

Study pseudoholomorphic maps using canonical connection.