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,695 papers · 148 categories

Trend · papers per month

142285427569 · Jun 202019922001200920172026
48 results for symmetric error terms

The paper extends Weyl's law to CROSSes, showing sharpness and polynomial improvement.

problem Understanding the error term in Weyl's law for different types of manifolds.
method Analyzing the Laplacian eigenvalues on Compact Rank One Symmetric Spaces (CROSSes).
result For CROSSes, the error term in Weyl's law is sharp, and for products of CROSSes, it can be polynomially improved.

In this paper, a novel neural network activation function, called Symmetrical Gaussian Error Linear Unit (SGELU), is proposed to obtain high performance. It is achieved by effectively integrating the property of the stochastic regularizer in the Gaussian Error Linear Unit (GELU) with the symmetrical characteristics. Co…

2019-11-10abs ↗pdf ↗

We consider active maximum a posteriori (MAP) inference problem for Hidden Markov Models (HMM), where, given an initial MAP estimate of the hidden sequence, we select to label certain states in the sequence to improve the estimation accuracy of the remaining states. We develop an analytical approach to this problem for…

2014-11-03abs ↗pdf ↗

Symmetrizes loss functions to improve neural network robustness against noisy labels.

problem Designing robust loss functions for noisy labels in neural networks.
method Symmetrization of multi-class loss functions, focusing on cross-entropy and unhinged loss.
result The multi-class unhinged loss is the unique convex symmetric loss under suitable assumptions.

We consider the minimum error entropy (MEE) criterion and an empirical risk minimization learning algorithm in a regression setting. A learning theory approach is presented for this MEE algorithm and explicit error bounds are provided in terms of the approximation ability and capacity of the involved hypothesis space w…

2012-08-03abs ↗pdf ↗

The study sets lower bounds on MMSE for inferring sensitive features from noisy data.

problem Estimating sensitive features from noisy observations of correlated features.
method Adversarial evaluation framework based on MMSE estimation with theoretical lower bounds.
result Derives closed-form bounds for linear models, showing optimality in noise variance.

We consider active, semi-supervised learning in an offline transductive setting. We show that a previously proposed error bound for active learning on undirected weighted graphs can be generalized by replacing graph cut with an arbitrary symmetric submodular function. Arbitrary non-symmetric submodular functions can be…

2012-02-14abs ↗pdf ↗

The paper explores how neural networks learn logical functions and their generalization error.

problem Learning logical functions with neural networks and understanding generalization error.
method Gradient descent on neural networks, analyzing noise-stability and Boolean influence.
result Gradient descent on certain neural architectures tends to favor low-degree representations, impacting generalization error.

This paper aims to provide a better understanding of a symmetric loss. First, we emphasize that using a symmetric loss is advantageous in the balanced error rate (BER) minimization and area under the receiver operating characteristic curve (AUC) maximization from corrupted labels. Second, we prove general theoretical p…

2019-01-27abs ↗pdf ↗

Group-invariant neural networks improve approximation accuracy for symmetric functions.

problem Improving approximation accuracy for symmetric functions using neural networks.
method Investigates the generalization error of group-invariant neural networks within the Barron framework.
result Group invariance introduces a factor δ that can significantly improve approximation accuracy when it is small.

The paper bounds generalization errors for deep neural networks with Markov datasets.

problem Bounding generalization errors for deep learning with Markov datasets.
method Developed new symmetrization inequalities for Markov chains, using spectral gap of the infinitesimal generator.
result Derived upper bounds on generalization errors for deep neural networks with Markov datasets.

Convolutional neural networks handle rotated image symmetries without dimensionality issues.

problem Binary image classification with rotational symmetry.
method Least squares plug-in classifiers based on convolutional neural networks under rotationally symmetric assumptions.
result Convolutional neural networks can circumvent the curse of dimensionality in binary image classification with rotational symmetry.

In this work we prove that every locally symmetric smooth submanifold gives rise to a naturally defined smooth submanifold of the space of symmetric matrices, called spectral manifold, consisting of all matrices whose ordered vector of eigenvalues belongs to the locally symmetric manifold. We also present an explicit f…

2012-12-17abs ↗pdf ↗

In this paper, we introduce a notion of a left-symmetric algebroid, which is a generalization of a left-symmetric algebra from a vector space to a vector bundle. The left multiplication gives rise to a representation of the corresponding sub-adjacent Lie algebroid. We construct left-symmetric algebroids from $\mathcal …

2013-12-23abs ↗pdf ↗

In recent years, correntropy has been seccessfully applied to robust adaptive filtering to eliminate adverse effects of impulsive noises or outliers. Correntropy is generally defined as the expectation of a Gaussian kernel between two random variables. This definition is reasonable when the error between the two random…

2019-11-21abs ↗pdf ↗

We consider the problem of learning regression functions from pairwise data when there exists prior knowledge that the relation to be learned is symmetric or anti-symmetric. Such prior knowledge is commonly enforced by symmetrizing or anti-symmetrizing pairwise kernel functions. Through spectral analysis, we show that …

2015-06-19abs ↗pdf ↗

Paper classifies compact symmetric triads using double Satake diagrams and canonical forms.

problem Classifying compact symmetric triads.
method Introducing double Satake diagrams and canonical forms, proving their existence and properties.
result Existence and properties of canonical forms for compact simple symmetric triads.

Motivated by applications in neuroimaging analysis, we propose a new regression model, Sparse TensOr REsponse regression (STORE), with a tensor response and a vector predictor. STORE embeds two key sparse structures: element-wise sparsity and low-rankness. It can handle both a non-symmetric and a symmetric tensor respo…

2016-09-15abs ↗pdf ↗

We study the exponential map of connected symmetric spaces and characterize, in terms of midpoints and of infinitesimal conditions, when it is a diffeomorphism, generalizing the Dixmier-Saito theorem for solvable Lie groups. We then give a geometric characterization of the (strongly) exponential solvable symmetric spac…

2013-03-24abs ↗pdf ↗

New exact sequence links cohomology, automorphisms, and extensions of symmetric quandles.

problem Understanding the structure of extensions and automorphisms in symmetric quandles.
method Derived a four-term exact sequence relating 1-cocycles, second cohomology, and automorphisms.
result Obstruction to automorphisms lies in the second cohomology of symmetric quandles.

Artificial neural networks are most commonly trained with the back-propagation algorithm, where the gradient for learning is provided by back-propagating the error, layer by layer, from the output layer to the hidden layers. A recently discovered method called feedback-alignment shows that the weights used for propagat…

2016-09-06abs ↗pdf ↗

The theory of geometric zeta functions for locally symmetric spaces as initialized by Selberg and continued by numerous mathematicians is generalized to the case of higher rank spaces. We show analytic continuation, describe the divisor in terms of tangential cohomology and in terms of group cohomology which generalize…

1995-11-10abs ↗pdf ↗

We study the ribbon discs that arise from a symmetric union presentation of a ribbon knot. A natural notion of symmetric ribbon number is introduced and compared with the classical ribbon number. We show that the gap between these numbers can be arbitrarily large by constructing an infinite family of ribbon knots with …

2014-07-24abs ↗pdf ↗

Unified plug-in approach for estimating symmetric properties of distributions efficiently.

problem Estimating symmetric properties of distributions with high accuracy and efficiency.
method Profile-maximum-likelihood (PML) based estimator.
result Achieves theoretical limit for universal symmetric property estimation.

In this paper, we address the problem of determining a function in terms of its orbital integrals on Lorentzian symmetric spaces. It has been solved by S. Helgason for even-dimensional isotropic Lorentzian symmetric spaces via a limit formula involving the Laplace-Beltrami operator. The result has been extended by J. O…

2018-04-23abs ↗pdf ↗

The study examines subgroups of braid groups related to symmetric groups.

problem Characterizing subgroups of braid groups that are extensions of symmetric groups.
method Analyzing normal subgroups of braid groups and their quotient structures.
result There are exactly 8 commensurability classes of such subgroups for n4n\geq 4.

We construct non-symmetric diffusion processes associated with Dirichlet forms consisting of uniformly elliptic forms and derivation operators with killing terms on RCD spaces by aid of non-smooth differential structures introduced by Gigli '16. After constructing diffusions, we investigate conservativeness and the wea…

2017-09-25abs ↗pdf ↗

Let XX be a compact hyperbolic Riemann surface equipped with the Poincaré metric. For any integer k2k\geq 2, we investigate the Bergman kernel associated to the holomorphic Hermitian line bundle ΩXkΩ^{\otimes k}_X, where ØØ is the holomorphic cotangent bundle of XX. Our first main result estimates the corresponding B…

2019-09-09abs ↗pdf ↗

This paper employs the extrinsic information transfer (EXIT) method, a technique imported from the analysis of the iterative decoding of error control codes, to study the performance of belief propagation in community detection in the presence of side information. We consider both the detection of a single (hidden) com…

2019-01-08abs ↗pdf ↗

RotEqNet preserves rotation symmetry in fluid systems using high-order tensors.

problem Lack of rotational symmetry in machine learning models for fluid systems.
method Introduces RotEqNet, a network that guarantees rotation-equivariance for high-order tensors.
result RotEqNet reduces errors and maintains rotation-equivariance in fluid systems.