We propose a novel method of introducing structure into existing machine learning techniques by developing structure-based similarity and distance measures. To learn structural information, low-dimensional structure of the data is captured by solving a non-linear, low-rank representation problem. We show that this low-…
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
48 results for “non-linear similarity”
In the two parts of this paper we solve a problem of De Rham, proving that Reidemeister torsion invariants determine topological equivalence of linear G-representations, for G a finite cyclic group. Methods in controlled K-theory and surgery theory are developed to establish, and effectively calculate, a necessary and …
Fiedler and Mallet-Paret prove a version of the classical Poincaré-Bendixson Theorem for scalar parabolic equations. We prove that a similar result holds for bounded solutions of the non-linear Cauchy-Riemann equations. The latter is an application of an abstract theorem for flows with a(n) (unbounded) discrete Lyapuno…
The paper proposes using non-isotropic distances for more accurate trace link recommendation.
problem Time-consuming and error-prone creation and maintenance of trace links.
method Geometric viewpoint on semantic similarity using non-linear similarity measures.
result Non-isotropic distances improve trace link recommendation accuracy.
We provide a pointwise confidence bound for non-linear least-squares with fixed design.
problem Confidence estimation in non-linear -regularized least squares.
method Pointwise confidence bound for local minimizers, using weighted norm involving inverse-Hessian.
result The proposed confidence bound scales with the test input's similarity to the training data.
Quantum computing offers a quadratic speedup for estimating non-linear functionals.
problem Estimating non-linear functionals of probability distributions.
method Proposes a quantum-inside-quantum Monte Carlo algorithm for a broad class of non-linear estimation problems.
result Achieves a quadratic speedup for non-linear estimation problems, including nested conditional expectations and stochastic optimization.
We propose a new notion of `non-linearity' of a network layer with respect to an input batch that is based on its proximity to a linear system, which is reflected in the non-negative rank of the activation matrix. We measure this non-linearity by applying non-negative factorization to the activation matrix. Considering…
Improved texture synthesis using wavelet-based statistics with rectifier non-linearity.
problem Improving texture synthesis quality using wavelet representations.
method Proposes a family of statistics based on non-linear wavelet representations with a generalized rectifier non-linearity.
result Significantly improves visual quality of texture synthesis compared to classical wavelet-based models.
Develops a data-driven smoothing technique for high-dimensional, non-linear panel data.
problem Improving prediction accuracy in high-dimensional, non-linear panel data models.
method Adaptive discrete smoothing with data-driven weights based on individual function similarity.
result Significant improvement in prediction accuracy compared to traditional linear panel data estimators.
New activation networks improve model efficiency and performance.
problem Creating hardware-efficient deep learning models.
method Restructurable Activation Networks (RANs) with RAN-explicit and RAN-implicit methods.
result RANs achieve state-of-the-art results with improved hardware efficiency.
Sharp L∞ estimates for fully non-linear elliptic equations on compact complex manifolds.
problem Sharp L∞ estimates for fully non-linear elliptic equations on compact complex manifolds.
method Comparison with auxiliary complex Monge-Ampère equations, Hölder-Young inequality, and De Giorgi iteration lemma.
result Improved L∞ estimates for fully non-linear elliptic equations on Kähler and Hermitian manifolds.
kdiff measures distances for time series and structured data.
problem Estimating distances between time series and structured data.
method kdiff uses non-linear kernel distances based on matching overlapping distributions.
result kdiff is more robust to noise and partial occlusions.
Paper proves rigidity for self-similar solutions in 3D flows.
problem Proving rigidity for self-similar solutions in curvature flows.
method Proves rigidity results for self-similar solutions of fully non-linear parabolic flows in R^3.
result Self-similar solutions are round spheres with genus zero.
Method estimates mixture components without discretizing parameters.
problem Learning from mixtures of continuous features with noise.
method Off-the-grid optimization method for continuous parameter space.
result Prediction error bound similar to Lasso predictor.
Currently, approximately 30% of epileptic patients treated with antiepileptic drugs (AEDs) remain resistant to treatment (known as refractory patients). This project seeks to understand the underlying similarities in refractory patients vs. other epileptic patients, identify features contributing to drug resistance acr…
There has been a growing interest in using non-parametric regression methods like Gaussian Process (GP) regression for system identification. GP regression does traditionally have three important downsides: (1) it is computationally intensive, (2) it cannot efficiently implement newly obtained measurements online, and …
A new method identifies similar mutual funds using graph learning.
problem Identifying similar mutual funds with nuanced portfolio similarities.
method Node2Vec machine learning method applied to a weighted bipartite network of funds and assets.
result Identifies structural similarity among mutual funds' portfolios.
We construct a Weil-Petersson geodesic completion of Teichmuller space through the formalism of Coxeter complex with the Teichmuller space as its non-linear non-homogeneous fundamental domain. We show that the metric and geodesic completions both satisfy a finite rank property, demonstrating a similarity with the non-c…
This paper explains a mechanism called phase collapse that improves image classification accuracy.
problem Understanding the role of non-linearities and convolutional filters in image classification.
method Demonstrates phase collapse as a mechanism that eliminates spatial variability and linearly separates classes.
result Phase collapse improves classification accuracy, while thresholding operators degrade performance.
Paper proposes a novel SVM method for creating survival trees.
problem Creating non-linear survival trees for right-censored data.
method L2-regularized dipole splitting criteria with kernel methods.
result Non-linear splits using polynomial and Gaussian kernels show similar predictive power but often smaller tree sizes.
Different neural networks trained on the same dataset often learn similar input-output mappings with very different weights. Is there some correspondence between these neural network solutions? For linear networks, it has been shown that different instances of the same network architecture encode the same representatio…
We consider a general class of non-linear Bellman equations. These open up a design space of algorithms that have interesting properties, which has two potential advantages. First, we can perhaps better model natural phenomena. For instance, hyperbolic discounting has been proposed as a mathematical model that matches …
New proof shows origin-centred balls are unique solutions to curvature problems.
problem Proving uniqueness of solutions to curvature problems.
method Local Brunn-Minkowski inequality and Alexandrov-Fenchel inequality.
result Origin-centred balls are the only solutions to curvature and related problems.
A new clustering method estimates non-linear boundaries and automatically selects the number of clusters.
problem Discriminative clustering with non-linear boundaries and data abnormalities.
method Regularized mutual information objective function with a mixture of Gaussian and uniform distributions.
result Automatic selection of the number of components and estimation of non-linear boundaries.
This work briefly explores the possibility of approximating spatial distance (alternatively, similarity) between data points using the Isolation Forest method envisioned for outlier detection. The logic is similar to that of isolation: the more similar or closer two points are, the more random splits it will take to se…
Kernelized Taylor diagram visualizes data populations with fewer assumptions.
problem Limitations of Taylor diagram in capturing non-linear relationships and sensitivity to outliers.
method Proposes a kernelized version of the Taylor diagram that uses maximum mean discrepancy and kernel mean embedding.
result Kernelized Taylor diagram visualizes data populations with minimal assumptions of data distributions.
This paper introduces an acceleration structure for hyperbolic embeddings.
problem Efficiently embedding and visualizing high-dimensional data in hyperbolic spaces.
method Building upon a polar quadtree, the paper introduces a new acceleration structure for hyperbolic embeddings.
result The new method computes embeddings in significantly less time compared to existing methods.
We introduce a new distance metric for non-linear embeddings of Tempered Exponential Measures.
problem Non-linear embeddings of Tempered Exponential Measures (TEMs).
method Parameterization of finite discrete TEMs via Legendre functions, introducing tempered Hilbert co-simplex distance.
result Established a generalization of the Hilbert log cross-ratio simplex distance to a tempered Hilbert co-simplex distance.
Kernelized convex clustering handles non-linear and non-convex data.
problem Lack of effective clustering methods for non-linear and non-convex data.
method Kernelized convex clustering in RKHS.
result Superior performance compared to state-of-the-art techniques.
The one-class kernel spectral regression (OC-KSR), the regression-based formulation of the kernel null-space approach has been found to be an effective Fisher criterion-based methodology for one-class classification (OCC), achieving state-of-the-art performance in one-class classification while providing relatively hig…
Constructing Effective Machine Learning Models for the Sciences: A Multidisciplinary Perspectivecs.LG
The study explores how machine learning can enhance scientific research.
problem Improving scientific models with machine learning.
method Analysis of data-driven models versus manually added variables in regression.
result Complex models may not always improve over simpler ones in scientific contexts.
Gradient descent fails to train two-layer ReLU networks, leading to poor performance.
problem Gradient descent training of two-layer ReLU networks initialized by He et al. (2015) fails to find optimal solutions.
method Gradient descent on a least-squares loss for training two-layer (Leaky)ReLU networks.
result Gradient descent only finds bad local minima, leading to linear regression for non-linear target functions.
A number of approaches to solving the well-known transfer pricing problem are known. However, few models satisfactorily resolve the core problem of allowing both the source and receiving divisions to earn a profit on transfers during a period in such a way that sub-optimal output levels are avoided. In 1969, Samuel pro…
This research uses DPPs to improve semi-parametric regression models.
problem Improving comprehensibility in semi-parametric regression models without sacrificing accuracy.
method Introduced a novel representation of finite DPPs and used it to derive a key identity illustrating implicit regularization.
result Demonstrated the implicit regularization effect of determinantal sampling for semi-parametric regression.
Multivariate categorical data occur in many applications of machine learning. One of the main difficulties with these vectors of categorical variables is sparsity. The number of possible observations grows exponentially with vector length, but dataset diversity might be poor in comparison. Recent models have gained sig…
Differential forms on the Fréchet manifold F(S,M) of smooth functions on a compact k-dimensional manifold S can be obtained in a natural way from pairs of differential forms on M and S by the hat pairing. Special cases are the transgression map associating (p-k)-forms on F(S,M) to p-forms on M (hat pairing with a const…
A simple framework Probabilistic Multi-view Graph Embedding (PMvGE) is proposed for multi-view feature learning with many-to-many associations so that it generalizes various existing multi-view methods. PMvGE is a probabilistic model for predicting new associations via graph embedding of the nodes of data vectors with …
Building highly non-linear and non-parametric models is central to several state-of-the-art machine learning systems. Kernel methods form an important class of techniques that induce a reproducing kernel Hilbert space (RKHS) for inferring non-linear models through the construction of similarity functions from data. The…
We propose a new way of thinking about deep neural networks, in which the linear and non-linear components of the network are naturally derived and justified in terms of principles in probability theory. In particular, the models constructed in our framework assign probabilities to uncertain realizations, leading to Ku…
Study local differential privacy methods for estimating power sums of discrete distributions.
problem Estimating non-linear functionals of discrete distributions under local differential privacy constraints.
method Interactive and non-interactive mechanisms for estimating power sums, with lower bounds provided.
result Achieves faster rates of estimation under certain conditions.
It has long been suggested that the biological brain operates at some critical point between two different phases, possibly order and chaos. Despite many indirect empirical evidence from the brain and analytical indication on simple neural networks, the foundation of this hypothesis on generic non-linear systems remain…
We study the emergence of sparse representations in neural networks. We show that in unsupervised models with regularization, the emergence of sparsity is the result of the input data samples being distributed along highly non-linear or discontinuous manifold. We also derive a similar argument for discriminatively trai…
Probabilistic Riemannian submanifold learning with wrapped Gaussian process latent variable modelsstat.ML
Latent variable models (LVMs) learn probabilistic models of data manifolds lying in an \emph{ambient} Euclidean space. In a number of applications, a priori known spatial constraints can shrink the ambient space into a considerably smaller manifold. Additionally, in these applications the Euclidean geometry might induc…
Spatio-temporal prediction plays an important role in many application areas especially in traffic domain. However, due to complicated spatio-temporal dependency and high non-linear dynamics in road networks, traffic prediction task is still challenging. Existing works either exhibit heavy training cost or fail to accu…
To every Darboux integrable system there is an associated Lie group which is a fundamental invariant of the system and which we call the Vessiot group. This article shows that solving the Cauchy problem for a Darboux integrable partial differential equation can be reduced to solving an equation of Lie type for the …
Classifies non-linear Fredholm maps linking to stable homotopy groups of spheres.
problem Classifying non-linear proper Fredholm maps between Hilbert spaces.
method Using stable homotopy groups of spheres to classify maps up to proper homotopy.
result Determines the non-trivial kernel of the map from stable homotopy groups to non-linear proper Fredholm maps.
Paper uses non-linear dimension reduction for better economic forecasting.
problem Analyzing economic effects of shocks in large datasets.
method Non-linear dimension reduction in factor-augmented vector autoregressions.
result Non-linear dimension reduction techniques improve forecasting, especially in volatile data.
We show how the tangent functor extends from ordinary smooth maps to "microformal morphisms" (also called "thick morphisms") of supermanifolds. Microformal morphisms generalize ordinary maps and correspond to formal canonical relations between the cotangent bundles specified by generating functions depending on positio…