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

Trend · papers per month

3977931,1901,586 · Jun 202019922001200920172026
48 results for symmetric learning rules

Improved convergence speed of principal component analysis through modified learning rules.

problem Slow convergence for covariance matrices with close eigenvalues.
method Introduced an additional term to the objective function to mitigate convergence issues.
result Significantly improved convergence speed confirmed through simulations.

Unified quadrature framework for large-scale kernel machines.

problem Efficiently approximating kernel functions for large-scale machine learning.
method Deterministic and randomized interpolatory rules for numerical integration of kernel functions.
result The proposed method reduces the number of nodes needed for accurate kernel approximation.

New method classifies manifold-valued data using Riemannian geometry.

problem Classifying data on curved Riemannian manifolds.
method Probabilistic Learning Vector Quantization on Symmetric Positive Definite Matrices.
result The method outperforms traditional Euclidean methods on manifold-valued data.

Proposes an alternative method to train RBMs with binary synapses using Bayesian learning rule.

problem Training RBMs with binary synapses is challenging due to discrete nature of synapses.
method Proposes an alternative optimization method using the Bayesian learning rule, updating natural parameters instead of expectation parameters.
result No additional clipping is needed as natural parameters take values in the entire real domain.

A vast majority of computation in the brain is performed by spiking neural networks. Despite the ubiquity of such spiking, we currently lack an understanding of how biological spiking neural circuits learn and compute in-vivo, as well as how we can instantiate such capabilities in artificial spiking circuits in-silico.…

2017-05-31abs ↗pdf ↗

We give a method to calculate spectra of the square of the Rarita-Schwinger operator on compact symmetric spaces. According to Weitzenböck formulas, the operator can be written by the Laplace operator, which is the Casimir operator on compact symmetric spaces. Then we can obtain the spectra by using the Freudenthal's f…

2020-01-17abs ↗pdf ↗

Abstraction and realization are bilateral processes that are key in deriving intelligence and creativity. In many domains, the two processes are approached through rules: high-level principles that reveal invariances within similar yet diverse examples. Under a probabilistic setting for discrete input spaces, we focus …

2017-09-06abs ↗pdf ↗

New characterizations of ruled real hypersurfaces in complex projective space found.

problem Characterizing ruled real hypersurfaces in complex projective space.
method Defined tensor fields related to Levi-Civita and generalized Tanaka-Webster connections and studied the structure operator.
result Obtained new characterizations of ruled real hypersurfaces in complex projective space.

The present paper proposes generalized Gaussian kernel adaptive filtering, where the kernel parameters are adaptive and data-driven. The Gaussian kernel is parametrized by a center vector and a symmetric positive definite (SPD) precision matrix, which is regarded as a generalization of the scalar width parameter. These…

2018-04-25abs ↗pdf ↗

We give a geometric description of the fusion rules of the affine Lie algebra su(2)_k at a positive integer level k in terms of the k-th power of the basic gerbe over the Lie group SU(2). The gerbe can be trivialised over conjugacy classes corresponding to dominant weights of su(2)_k via a 1-isomorphism. The fusion-rul…

2009-09-01abs ↗pdf ↗

We show that for any Legendrian link LL in the 11-jet space of S1S^1 the 22-graded ruling polynomial, RL2(z)R^2_L(z), is determined by the Thurston-Bennequin number and the HOMFLY-PT polynomial. Specifically, we recover RL2(z)R^2_L(z) as a coefficient of a particular specialization of the HOMFLY-PT polynomial. Furthermore, …

2010-06-16abs ↗pdf ↗

Paper constructs an example of a non-compact submanifold in a quaternionic Kähler symmetric space.

problem Tackles the construction of a non-compact totally complex submanifold in a quaternionic Kähler symmetric space.
method Uses an isometric action of a compact Lie group and a maximal totally geodesic sphere.
result Proves the existence of a non-compact totally complex submanifold of maximal dimension in a compact quaternionic Kähler symmetric space.

The flow of a torus by inverse mean curvature keeps total curvature bounded until singularity.

problem Understanding the behavior of a torus under inverse mean curvature flow until singularity.
method Analyzing the evolution of a rotationally symmetric embedded torus in R3\mathbb{R}^{3} by inverse mean curvature flow.
result The total curvature remains bounded until the singular time TmaxT_{\max}.

Symmetric CNNs improve sequential recommendation and protein structure prediction.

problem Improving prediction accuracy in sequential recommendation and protein structure inference.
method Developed a CNN architecture that preserves symmetry in convolutional layers, using parameterized convolutional kernels.
result Symmetric structured CNNs achieve better performance with fewer parameters.

Study on surfaces with constant curvature under a specific connection.

problem Classifying surfaces with constant sectional curvature under a semi-symmetric non-metric connection.
method Analyzing surfaces in R3\mathbb{R}^3 with a canonical semi-symmetric non-metric connection determined by a vector field.
result Classification of surfaces under various conditions (cylindrical, rotational) with constant sectional curvature.

We show that one can skip the skew-symmetry assumption in the definition of Nambu-Poisson brackets. In other words, a n-ary bracket on the algebra of smooth functions which satisfies the Leibniz rule and a n-ary version of the Jacobi identity must be skew-symmetric. A similar result holds for a non-antisymmetric versio…

2001-04-11abs ↗pdf ↗

Using Seiberg-Witten theory, it is shown that any Kaehler metric of constant negative scalar curvature on a compact 4-manifold M minimizes the L^2-norm of scalar curvature among Riemannian metrics compatible with a fixed decomposition H^2(M)=(H^+) + (H^-). This implies, for example, that any such metric on a minimal ru…

1995-06-05abs ↗pdf ↗

New framework learns interpretable rule ensembles without sacrificing accuracy.

problem Trade-off between accuracy and interpretability in rule ensembles.
method Introduces local interpretability and a regularizer to promote it, using coordinate descent with local search.
result Learns rule ensembles with fewer rules to explain individual predictions, maintaining comparable accuracy.

DeepCTRL integrates rules into deep learning models, allowing flexible control at inference.

problem Lack of flexibility in incorporating rules into deep learning models.
method Integrates rule representations into deep neural networks, enabling flexible control at inference.
result Improves rule verification ratio and accuracy gains at downstream tasks.

In this article supervised learning problems are solved using soft rule ensembles. We first review the importance sampling learning ensembles (ISLE) approach that is useful for generating hard rules. The soft rules are then obtained with logistic regression from the corresponding hard rules. In order to deal with the p…

2012-05-21abs ↗pdf ↗

New methods prune unpromising rules from KGs, improving scalability and runtime.

problem Scalability issues in walk-based rule learning from KGs.
method Rule Hierarchy Framework (RHF) and Hierarchical Pruning (HPMs).
result Significant reductions in runtime and number of learned rules without compromising predictive performance.

Paper extends transfer learning for decision rules, improving treatment rule estimation.

problem Estimating optimal individualized treatment rules under changing conditions.
method Bayes decision rules and low-dimensional empirical risk minimization.
result Consistent estimators and risk bounds established under mild conditions.

Study explores reinforcement learning in a complex game environment, analyzing rule inference and policy learning.

problem Learning optimal policies in environments with hidden rules.
method Investigated using the Game Of Hidden Rules (GOHR) environment, employing Feature-Centric and Object-Centric state representations with a Transformer-based A2C algorithm.
result Transformer-based A2C models outperform traditional methods in GOHR, demonstrating the effectiveness of representation strategies.

CRL approach improves understanding of heterogeneous treatment effects in complex diseases.

problem Estimating heterogeneous treatment effects in complex diseases.
method Causal rule learning (CRL) workflow consisting of rule discovery, selection, and analysis.
result CRL outperforms other methods in providing interpretable estimates of HTE.

Generative models learn rules at different timescales, revealing a 'innovation window'.

problem Generative models' convergence to empirical training distribution rather than population distribution.
method Rule-valid synthetic tasks, analyzing τruleτ_{\mathrm{rule}} and τmemτ_{\mathrm{mem}} across training timescales.
result The 'innovation window' widens with increasing dataset size and narrows with rule complexity.

A new learning rule consistently reduces error over data samples.

problem Finding a learning rule that consistently reduces error over all data distributions.
method A deterministic, data-dependent partitioning rule that only partitions cyclic intervals with sufficient empirical diversity of labels.
result The expected error is monotone non-increasing with the sample size under every data distribution.

Advances rule-based multi-label classification using conformal prediction.

problem Improving accuracy and decision making in multi-label classification.
method Combines conformal prediction with rule-based learning to provide natural conformity scores and calibrate rule assessments.
result Calibrated conformity scores enhance prediction accuracy and decision making.

Statistical relational models provide compact encodings of probabilistic dependencies in relational domains, but result in highly intractable graphical models. The goal of lifted inference is to carry out probabilistic inference without needing to reason about each individual separately, by instead treating exchangeabl…

2016-10-26abs ↗pdf ↗

A new robust and flexible classification method for non-Gaussian data.

problem Robustness to scale changes and non-Gaussian distributions in classical discriminant analysis.
method FEMDA uses arbitrary Elliptically Symmetrical distributions and scale parameters for each data point.
result FEMDA is robust to scale changes and outperforms other methods.

New pivoting strategy improves trace norm contraction in low-rank approximation.

problem Finding good low-rank approximations of symmetric, positive-definite matrices.
method Choosing rows with likelihood proportional to Aii2A_{ii}^2 for randomly pivoted partial Cholesky algorithm.
result Same trace norm contraction result in Frobenius norm for improved pivoting strategy.

Throughout music history, theorists have identified and documented interpretable rules that capture the decisions of composers. This paper asks, "Can a machine behave like a music theorist?" It presents MUS-ROVER, a self-learning system for automatically discovering rules from symbolic music. MUS-ROVER performs feature…

2016-06-17abs ↗pdf ↗