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

6.3%12.5%18.8%25.0% · Oct 199319922001200920172026
48 results for hidden Born machine

A new AI optimization method uses energy-conserving dynamics inspired by Born-Infeld theory.

problem Optimization challenges in non-convex loss functions and machine learning tasks.
method Discretization of Born-Infeld dynamics for energy-conserving Hamiltonian optimization.
result The method avoids high local minima and outperforms traditional methods in shallow valleys.

Quantum circuit Born machines are generative models which represent the probability distribution of classical dataset as quantum pure states. Computational complexity considerations of the quantum sampling problem suggest that the quantum circuits exhibit stronger expressibility compared to classical neural networks. O…

2018-04-11abs ↗pdf ↗

Tensor-network techniques have enjoyed outstanding success in physics, and have recently attracted attention in machine learning, both as a tool for the formulation of new learning algorithms and for enhancing the mathematical understanding of existing methods. Inspired by these developments, and the natural correspond…

2019-07-08abs ↗pdf ↗

A new method creates simpler, more interpretable decision trees from complex ensembles.

problem Complex tree ensembles reduce interpretability and control over machine learning models.
method Dynamic-programming based algorithm for finding a minimum-size decision tree.
result Optimal born-again trees are simpler and more interpretable than original ensembles.

Study equivalence between Hessian and Born structures on tangent bundles.

problem Equivalence between Hessian and Born structures on tangent bundles.
method Analyzing conditions for Hessian structures and integrability of induced almost Born structures.
result Conditions for equivalence between Hessian and Born structures are established.

Neural networks learn higher-order derivatives for physics problems.

problem Lack of higher-order derivatives in neural networks for theoretical physics.
method Graph-theoretical approach to assign diagrams to partial derivatives, iterative NN perturbation theory.
result NNs can learn higher-order derivatives, improving machine-learned approximations.

The study identifies latent concepts from diverse observations without assuming specific models.

problem Lack of general theoretical support for concept learning.
method Develops a nonparametric framework for identifying latent concepts from multiple classes of observations.
result Correctness guarantees for concept identification without parametric assumptions.

Study Born-Infeld solitons and solve Björling problem for them.

problem Existence and non-uniqueness of solutions to the Björling problem for Born-Infeld solitons.
method Two approaches: treating as time-like minimal surfaces or using Barbashov-Chernikov representation.
result Solution to Björling problem may not be unique.

Quantum circuit models learn better with specific initialization strategies.

problem Understanding and improving the optimization landscape of IQP-based generative models.
method Proved barren plateaus for random initialization, established lower bounds, and developed data-dependent initialization.
result Data-dependent initialization leads to faster convergence and better minimums.

Lie symmetry group method is applied to study the Born-Infeld equation. The symmetry group and its optimal system are given, and group invariant solutions associated to the symmetries are obtained. Finally the structure of the Lie algebra symmetries is determined.

2010-09-28abs ↗pdf ↗

We show that a Born-Infeld soliton can be realised either as a spacelike minimal graph or timelike minimal graph over a timelike plane or a combination of both away from singular points. We also obtain some exact solutions of the Born-Infeld equation from already known solutions to the maximal surface equation. Further…

2017-02-21abs ↗pdf ↗

We give a concise summary of the para-Hermitian geometry that describes a doubled target space fit for a covariant description of T-duality in string theory. This provides a generalized differentiable structure on the doubled space and leads to a kinematical setup which allows for the recovery of the physical spacetime…

2019-04-15abs ↗pdf ↗

Knowledge Distillation (KD) consists of transferring “knowledge” from one machine learning model (the teacher) to another (the student). Commonly, the teacher is a high-capacity model with formidable performance, while the student is more compact. By transferring knowledge, one hopes to benefit from the student’s…

2018-05-12abs ↗pdf ↗

It has been known for a while that the effective geometrical description of compactified strings on dd-dimensional target spaces implies a generalization of geometry with a doubling of the sets of tangent space directions. This generalized geometry involves an O(d,d)O(d,d) pairing ηη and an O(2d)O(2d) generalized metric $\m…

2018-06-15abs ↗pdf ↗

A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a path in the graph can determine which node they are at currently or which nodes wer…

2018-11-09abs ↗pdf ↗

RBM models reveal how hidden unit tail behavior affects pattern reconstruction.

problem Understanding how the tail behavior of hidden units in RBMs influences pattern reconstruction.
method Identified an effective energy function for RBMs and studied its local minima.
result The ability to reconstruct patterns depends on the tail behavior of the hidden unit prior distribution.

Deep Learning is one of the newest trends in Machine Learning and Artificial Intelligence research. It is also one of the most popular scientific research trends now-a-days. Deep learning methods have brought revolutionary advances in computer vision and machine learning. Every now and then, new and new deep learning t…

2018-07-21abs ↗pdf ↗

The paper studies graphs with prescribed Lorentzian mean curvature and their relation to Born-Infeld theory.

problem Existence and regularity of spacelike graphs with prescribed Lorentzian mean curvature.
method Analyzes the action functional and uses variational methods to study the existence and regularity of the graph function.
result Sufficient conditions are found to ensure that the graph function solves the Born-Infeld equation and enjoys improved regularity estimates.

Since learning is typically very slow in Boltzmann machines, there is a need to restrict connections within hidden layers. However, the resulting states of hidden units exhibit statistical dependencies. Based on this observation, we propose using l1/l2l_1/l_2 regularization upon the activation possibilities of hidden unit…

2010-08-30abs ↗pdf ↗

In this paper a convergent series expansion is constructed to solve the prescribed mean curvature equation for n-dimensional hypersurfaces in n+1 dimensional Euclidean or Minkowskian space(time) which are graphs of a smooth real function u, and whose mean curvature function H is not too large in Hoelder norm, and integ…

2010-09-08abs ↗pdf ↗

The height function of various surfaces decomposes into finite sums of scaled and translated versions of itself.

problem Decomposing the height function of different types of surfaces into simpler components.
method Using Euler-Ramanujan identities and Weierstrass-Enneper representation to decompose height functions of minimal, maximal, timelike minimal, and Born-Infeld surfaces.
result The height function of various surfaces can be expressed as a finite sum of scaled and translated versions of itself.

Study shows limitations and possibilities of learning quantum circuit output distributions.

problem Learnability of output distributions of local quantum circuits.
method Investigated within two oracle models: statistical query model and direct sample access model.
result Output distributions of super-logarithmic depth Clifford circuits are not efficiently learnable in the statistical query model.

This paper is concerned with the sparsification of the input-hidden weights of ELM (Extreme Learning Machine). For ordinary feedforward neural networks, the sparsification is usually done by introducing certain regularization technique into the learning process of the network. But this strategy can not be applied for E…

2018-01-22abs ↗pdf ↗

RBMs model binary interactions with hidden node activation effects.

problem Understanding how RBM hidden node activation affects binary variable distributions.
method Investigated RBM marginal distributions with different hidden node activation functions.
result Found exact expressions for RBM marginals as interacting binary variables.

We study a functional that derives from the classical Yang-Mills functional and Born-Infeld theory. We establish its first variation formula and prove the existence of critical points. We also obtain the second variation formula.

2018-11-05abs ↗pdf ↗

Let F:[0,)[0,)F: [0, \infty) \to [0, \infty) be a strictly increasing C2C^2 function with F(0)=0F(0)=0. We unify the concepts of FF-harmonic maps, minimal hypersurfaces, maximal spacelike hypersurfaces, and Yang-Mills Fields, and introduce FF-Yang-Mills fields, FF-degree, FF-lower degree, and generalized Yang-Mills-Born-Infeld…

2010-03-19abs ↗pdf ↗

Epsilon-machines are minimal, unifilar presentations of stationary stochastic processes. They were originally defined in the history machine sense, as hidden Markov models whose states are the equivalence classes of infinite pasts with the same probability distribution over futures. In analyzing synchronization, though…

2011-11-18abs ↗pdf ↗

As a new neural machine translation approach, Non-Autoregressive machine Translation (NAT) has attracted attention recently due to its high efficiency in inference. However, the high efficiency has come at the cost of not capturing the sequential dependency on the target side of translation, which causes NAT to suffer …

2019-02-22abs ↗pdf ↗

Chemical networks outperform spiking neural networks in classification tasks.

problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.

Paper introduces a new method to compute pseudoinverse for ELM with large datasets.

problem Efficient computation of pseudoinverse for ELM with large datasets.
method Rank-based matrix decomposition of the hidden layer matrix.
result Optimal training time and reduced computational complexity for large hidden nodes.

We present an overview of some older papers on involutory quandles, mostly from the times before the term "quandle" was born. It is meant as a reference guide, not (yet) as an expository article explaining what the involutory quandles are and what they are good for.

2015-06-08abs ↗pdf ↗