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.

169,051 papers · 148 categories

Trend · papers per month

14.7%29.5%44.2%59.0% · Jun 202019922001200920182026
48 results for prerequisite learning

PREREQ learns concept prerequisites from online educational resources.

problem Inferring prerequisite relations between educational concepts.
method PREREQ uses latent representations of concepts from Pairwise Latent Dirichlet Allocation and a Siamese neural network to learn from course prerequisites and labeled data.
result PREREQ outperforms state-of-the-art approaches and can learn from less data.

LectureBank helps students find the right NLP course sequence.

problem Finding the right NLP course sequence for students with no background.
method Embedding-based method and neural graph-based networks to learn prerequisite relations.
result LectureBank dataset aids in educational and application purposes.

We outline what we believe are the prerequisites and building-blocks for successfully devising trading models and other financial applications based on a complex systems perspective.

2014-05-23abs ↗pdf ↗

This encyclopedia article briefly reviews without proofs some of the main results in cotangent bundle reduction. The article recalls most the necessary prerequisites to understand the main results.

2005-08-31abs ↗pdf ↗

This encyclopedia article briefly reviews without proofs some of the main results in symplectic reduction. The article recalls most the necessary prerequisites to understand the main results, namely, group actions, momentum maps, and coadjoint orbits, among others.

2005-08-31abs ↗pdf ↗

Reliable and effective multi-task learning is a prerequisite for the development of robotic agents that can quickly learn to accomplish related, everyday tasks. However, in the reinforcement learning domain, multi-task learning has not exhibited the same level of success as in other domains, such as computer vision. In…

2018-02-03abs ↗pdf ↗

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful novel concept in algebraic geometry that generalizes the tensor CP decomposition…

2016-03-04abs ↗pdf ↗

We prove Gronwall-type estimates for the distance of integral curves of smooth vector fields on a Riemannian manifold. Such estimates are of central importance for all methods of solving ODEs in a verified way, i.e., with full control of roundoff errors. Our results may therefore be seen as a prerequisite for the gener…

2004-12-02abs ↗pdf ↗

Deep learning aids causal inference in complex settings.

problem Estimating heterogeneous treatment effects in non-linear, time-varying, and encoded confounders.
method Intuitive introduction to deep learning and causal inference, focusing on observational data.
result Maximizes accessibility to causal inference through deep learning.

We survey - by means of 20 examples - the concept of varifold, as generalised submanifold, with emphasis on regularity of integral varifolds with mean curvature, while keeping prerequisites to a minimum. Integral varifolds are the natural language for studying the variational theory of the area integrand if one conside…

2017-05-15abs ↗pdf ↗

We give a new, connected-sum-like construction of Riemannian metrics with special holonomy G_2 on compact 7-manifolds. The construction is based on a gluing theorem for appropriate elliptic partial differential equations. As a prerequisite, we also obtain asymptotically cylindrical Riemannian manifolds with holonomy SU…

2000-12-19abs ↗pdf ↗

We investigate metric learning in the context of dynamic time warping (DTW), the by far most popular dissimilarity measure used for the comparison and analysis of motion capture data. While metric learning enables a problem-adapted representation of data, the majority of methods has been proposed for vectorial data onl…

2016-10-17abs ↗pdf ↗

The correctness of Harrods model in the differential form is studied. The inadequacy of exponential growth of economy is shown; an alternative result is obtained. By example of Phillips model, an approach to correction of macroeconomic models (in terms of initial prerequisites) is generalized. A methodology based on ba…

2009-04-05abs ↗pdf ↗

In this largely expository paper we give a self-contained treatment of the Dirac operator. Emphasizing the algebraic point of view we first sketch the necessary prerequisites from Clifford algebras and their representations and then define (and characterize) spin structures and the corresponding Spin-Dirac operator pur…

2000-05-24abs ↗pdf ↗

The Teichmuller unipotent flow can be defined concretely on certain moduli spaces of singular flat surfaces by shearing polygonal presentations of the surfaces. Thurston's earthquake flow on moduli spaces of hyperbolic surfaces is more mysterious. Both flows have deep and important connections to other areas of mathema…

2018-10-17abs ↗pdf ↗

The correctness of Harrods model in the differential form is studied. The inadequacy of exponential growth of economy is shown; an alternative result is obtained. By example of Phillips model, an approach to correction of macroeconomic models (in terms of initial prerequisites) is generalized. A methodology based on ba…

2010-03-23abs ↗pdf ↗

The paper introduces new measures for quantifying uncertainty in machine learning.

problem Uncertainty representation and quantification in machine learning.
method Proper scoring rules for aleatoric and epistemic uncertainty quantification.
result Established a natural bridge between credal set and second-order distribution representations of uncertainty.

Machine learning aids scientific discoveries by explaining complex data.

problem Extracting scientific insights from complex data.
method Combining machine learning with domain knowledge for transparency, interpretability, and explainability.
result Enhanced scientific consistency through machine learning and domain knowledge integration.

Paper proposes a deep autoencoder model to detect anomalies in CAV locations.

problem Early detection of anomalies in self-reported vehicle locations for CAVs.
method Unsupervised learning model based on deep autoencoder using vehicle locations and RSSI.
result The proposed model is effective and robust in detecting self-reported location anomalies.

Paper calculates Torelli group's cohomology second group.

problem Calculating the second rational cohomology group of the Torelli group.
method Building on Hain's and Kupers-Randal-Williams's work, the paper provides an exposition of prerequisite material and the two key results.
result Calculation of the second rational cohomology group of the Torelli group.

We propose that predictability is a prerequisite for profitability on financial markets. We look at ways to measure predictability of price changes using information theoretic approach and employ them on all historical data available for NYSE 100 stocks. This allows us to determine whether frequency of sampling price c…

2013-10-21abs ↗pdf ↗

Develops trace class operators and inverse Laplacian theory for infinite dimensions.

problem Understanding trace class operators and inverse Laplacian on infinite dimensional spaces.
method Presentation of trace class operators and construction of inverse Laplacian on closed manifolds.
result Original trace computations involving the inverse Laplacian on the torus.

The paper introduces a method to create more reliable models for robot dynamics.

problem Creating accurate models for robot dynamics to improve control and planning algorithms.
method A primal-dual method to enforce constraints on error in specific parts of the state-space.
result The learned models have more predictable error characteristics, enhancing their usability for planning and control algorithms.

Improved neural network models predict molecular and material properties efficiently.

problem Training neural networks for accurate interatomic potentials is computationally expensive.
method Gaussian moment-based neural networks with improved architecture and active learning.
result The new models achieve high accuracy and reduced training times.

The ERI is a new index for measuring exam readiness.

problem Measuring exam readiness in a clear and actionable way.
method The ERI combines six signals derived from practice and mock tests, formalizing axioms for component maps and the composite.
result The ERI is a composite score interpretable and actionable for exam readiness.

The paper proposes an interpretable off-policy learning algorithm for medical treatments.

problem Lack of interpretable methods for personalized treatment decisions from observational data.
method Hyperbox search approach for interpretable policies in disjunctive normal form.
result The proposed algorithm outperforms state-of-the-art methods in terms of regret and is rated highly interpretable by clinical experts.

Semantically understanding complex drivers' encountering behavior, wherein two or multiple vehicles are spatially close to each other, does potentially benefit autonomous car's decision-making design. This paper presents a framework of analyzing various encountering behaviors through decomposing driving encounter data …

2018-07-27abs ↗pdf ↗

Study on dynamics of non-linear autoencoders learning principal components.

problem Technical difficulty in studying non-linear autoencoders due to non-trivial correlations.
method Derive asymptotically exact equations for SGD training of shallow, non-linear autoencoders.
result Autoencoders learn principal components sequentially and tie weights are ineffective.

EIGAN learns private representations without centralized data, outperforming state-of-the-art.

problem Private representation learning with multiple ally and adversary attributes.
method Exclusion-Inclusion Generative Adversarial Network (EIGAN) and Distributed EIGAN (D-EIGAN).
result EIGAN and D-EIGAN outperform state-of-the-art methods in accuracy and scalability.

Proposes using continuum percolation to analyze data manifolds and improve generative models.

problem Disentangling geometric support from probability distributions in high-dimensional data.
method Establishes a correspondence between topological phase transitions of random geometric graphs and data manifolds, using Percolation Shift metric.
result Demonstrates that Percolation Shift metric captures structural pathologies like mode collapse and guides training to prevent manifold shrinkage and improve fidelity.

A key prerequisite to optimal reasoning under uncertainty in intelligent systems is to start with good class probability estimates. This paper improves on the current best probability estimation trees (Bagged-PETs) and also presents a new ensemble-based algorithm (MOB-ESP). Comparisons are made using several benchmark …

2012-07-11abs ↗pdf ↗

The objective of this article is to build up a general theory of geometrical optics for spinning light rays in an inhomogeneous and anisotropic medium modeled on a Finsler manifold. The prerequisites of local Finsler geometry are reviewed together with the main properties of the Cartan connection used in this work. The…

2007-07-02abs ↗pdf ↗

This research optimizes handover between fog nodes in vehicular IoT using machine learning.

problem Smooth transition of device connections and offloaded tasks between fog nodes in vehicular IoT.
method Proposes a three-layer feed-forward neural network and a dual stacked RNN with LSTM cells to predict fog nodes and minimize service interruption.
result Achieved 99.2% accuracy in predicting fog nodes with a test set.

CSEAL uses cognitive structure to personalize learning paths.

problem Personalized learning paths based on learners' evolving knowledge levels and item structures.
method CSEAL integrates knowledge levels and item structures using a Markov Decision Process and actor-critic algorithm.
result CSEAL effectively personalizes learning paths, improving learning outcomes.

A new method for manifold learning using sparse regularised optimal transport.

problem Detecting latent manifolds in high-dimensional data with noisy observations.
method Proposes a symmetric version of optimal transport with quadratic regularisation to construct a sparse and adaptive affinity matrix.
result The method outperforms competing methods in numerical experiments and demonstrates robustness to heteroskedastic noise.