Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

3571106141 · May 202619922001200920172026
48 results for Kruskal Theorem

Paper identifies latent factors from noisy measurements using tensor decomposition.

problem Identification of latent factors from noisy, correlated measurements.
method Tensor decomposition of third order cross moments, Kruskal theorem, Kotlarski identity, generalized Kruskal rank.
result Full distribution of latent factors and measurement errors identified without injective measurements.

Study on identifiability of deep polynomial neural networks.

problem Understanding when polynomial neural networks can be uniquely identified.
method Comprehensive analysis including various architectures, using tensor decompositions and Kruskal-type theorems.
result Identifiability conditions for deep PNNs, including layer width and activation degree constraints.

New approach confirms Kruskal-Szekeres extension for Schwarzschild spacetime.

problem Confirming the Kruskal-Szekeres extension for Schwarzschild spacetime.
method Reformulating the problem as an ODE and showing the ODE admits a solution if and only if the horizon is non-degenerate.
result Photon surfaces approaching the Killing horizon must necessarily cross it.

A multi-way factor analysis model is introduced for tensor-variate data of any order. Each data item is represented as a (sparse) sum of Kruskal decompositions, a Kruskal-factor analysis (KFA). KFA is nonparametric and can infer both the tensor-rank of each dictionary atom and the number of dictionary atoms. The model …

2016-12-08abs ↗pdf ↗

Enhances tensor regression for interpretability and performance.

problem Interpreting and modeling multidimensional tensor data with structural heterogeneity.
method Generalized Nonnegative Structured Kruskal Tensor Regression (NS-KTR) with hybrid regularization and nonnegativity constraints.
result NS-KTR outperforms conventional methods in synthetic and real hyperspectral datasets.

New CSC model extracts EEG signals with low noise sensitivity.

problem Analyzing noisy EEG signals during anesthesia.
method Kruskal CSC model using Kruskal decomposition for low-rank tensor activations.
result TC-FISTA efficiently extracts robust, sparse, and interpretable EEG encodings.

Tensor decompositions have rich applications in statistics and machine learning, and developing efficient, accurate algorithms for the problem has received much attention recently. Here, we present a new method built on Kruskal's uniqueness theorem to decompose symmetric, nearly orthogonally decomposable tensors. Unlik…

2016-12-12abs ↗pdf ↗

We construct a Kruskal-Szekeres-type analytic extension of the Emparan-Reall black ring, and investigate its geometry. We prove that the extension is maximal, globally hyperbolic, and unique within a natural class of extensions. The key to those results is the proof that causal geodesics are either complete, or approac…

2008-07-15abs ↗pdf ↗

The geometry of five-dimensional Kerr black holes is discussed based on geodesics and Weyl curvatures. Kerr-Star space, Star-Kerr space and Kruskal space are naturally introduced by using special null geodesics. We show that the geodesics of AdS Kerr black hole are integrable, which generalizes the result of Frolov and…

2005-02-21abs ↗pdf ↗

Study measures uncertainty in MST identification across different correlation networks.

problem Uncertainty in MST identification across various correlation-based market networks.
method Developed a framework using random variable networks (RVN) to measure uncertainty of MST identification.
result FDR is the most appropriate measure for MST identification reliability.

This paper introduces a new multivariate convolutional sparse coding based on tensor algebra with a general model enforcing both element-wise sparsity and low-rankness of the activations tensors. By using the CP decomposition, this model achieves a significantly more efficient encoding of the multivariate signal-partic…

2019-08-09abs ↗pdf ↗

We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph. This leads to a characterization of chordal graphs via deletions of a sequence of exposed edges from a complete graph. Most interesti…

2017-06-14abs ↗pdf ↗

When response variables are nominal and populations are cross-classified with respect to multiple polytomies, questions often arise about the degree of association of the responses with explanatory variables. When populations are known, we introduce a nominal association vector and matrix to evaluate the dependence of …

2011-09-12abs ↗pdf ↗

We present a framework for incorporating prior information into nonparametric estimation of graphical models. To avoid distributional assumptions, we restrict the graph to be a forest and build on the work of forest density estimation (FDE). We reformulate the FDE approach from a Bayesian perspective, and introduce pri…

2015-11-12abs ↗pdf ↗

This paper is an expository account of the development of soliton mathematics, from its inception in famous numerical experiments of Fermi-Pasta-Ulam and Zabusky-Kruskal to the recent synthesis of Terng-Uhlenbeck (dg-ga/9707004) that explains hidden symmetries of soliton equations in terms of loop-groups acting by dres…

1997-08-08abs ↗pdf ↗

The existence, established over the past number of years and supporting earlier work of Ori [14], of physically relevant black hole spacetimes that admit C0C^0 metric extensions beyond the future Cauchy horizon, while being C2C^2-inextendible, has focused attention on fundamental issues concerning the strong cosmic cen…

2016-10-10abs ↗pdf ↗

We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estimation, we do not assume the true distribution corresponds to a forest; rather, we form kernel density estimates of the bivariate and univaria…

2010-01-10abs ↗pdf ↗

This paper identifies and estimates the label noise transition matrix without ground truth labels.

problem Learning with noisy labels and identifying the noise transition matrix.
method Building on Kruskal's identifiability results, the paper characterizes the identifiability of the label noise transition matrix for the generic case at the instance level.
result The necessity of multiple noisy labels in identifying the noise transition matrix for the generic case at the instance level.

Study shows nonextendibility of warped spacelike singularities in specific spacetimes.

problem Nonextendibility of warped spacelike singularities in specific spacetimes.
method Establishes a local obstruction through integrability conditions and radial compression.
result Imply C0C^0-inextendibility for the one-horizon Birmingham-Kottler family.

Portfolio allocation and risk management make use of correlation matrices and heavily rely on the choice of a proper correlation matrix to be used. In this regard, one important question is related to the choice of the proper sample period to be used to estimate a stable correlation matrix. This paper addresses this qu…

2019-11-14abs ↗pdf ↗

The Rectified Linear Unit (ReLU) is a foundational activation function in artficial neural networks. Recent literature frequently misattributes its origin to the 2018 (initial) version of this paper, which exclusively investigated ReLU at the classification layer. This paper formally corrects the citation record by tra…

2018-03-22abs ↗pdf ↗

The paper proves three circles theorems and Liouville type theorems for subharmonic and holomorphic functions.

problem Establishing theorems for subharmonic and holomorphic functions on specific geometric structures.
method Using subharmonic and holomorphic functions on Riemannian manifolds and gradient shrinking Ricci solitons.
result Proves Liouville type theorems as applications of the established theorems.

Paper generalizes complex Brunn-Minkowski theory and proves new extension theorems.

problem Complex Brunn-Minkowski theory and extension theorems.
method Hilbert bundle approach to complex Brunn-Minkowski theory.
result Generalizes Guan's sharp strong openness theorem and sharp Ohsawa-Takegoshi extension theorem.

Formulates Index III lemma and Rauch III theorem with applications.

problem Develops new mathematical theorems based on existing ones.
method Formulation of Index III lemma and Rauch III theorem based on Index I, II lemmas and Rauch I, II theorems.
result Presented Rauch's type theorem and volume comparison result as applications.

In LM, we proved a family version of the famous Witten rigidity theorems and several family vanishing theorems for elliptic genera. In this paper, we gerenalize our theorems LM in two directions. First we establish a family rigidity theorem for the Dirac operator on loop space twisted by general positive energy loop gr…

1999-11-05abs ↗pdf ↗

The paper explains the topological origin of the distinction between incidence theorems over division rings and fields.

problem Understanding the distinction between incidence theorems over division rings and fields.
method Extending the surface-graph approach to noncommutative settings, the paper analyzes the topological properties of graphs embedded on surfaces of different genera.
result Theorems associated with graphs on the sphere hold over any division ring, while those on surfaces of positive genus typically hold only if the ground ring is a field.

INT benchmark tests theorem proving agents' ability to generalize to unseen theorems.

problem Evaluating theorem proving agents' ability to generalize to unseen theorems.
method INT benchmark based on a theorem generation and proof procedure with adjustable knobs for measuring 6 types of generalization.
result MCTS can help agents prove new theorems.

A homological selection theorem for C-spaces, as well as, a finite-dimensional homological selection theorem is established. We apply the finite-dimensional homological selection theorem to obtain fixed-point theorems for usco homologically UV^n set-valued maps.

2016-05-11abs ↗pdf ↗