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.
Deep neural networks solve Raven's Progressive Matrices with high accuracy.
SCL discovers compositional structures in analogical reasoning tasks.
MXGNet tackles visual reasoning tasks using graph neural networks.
In this work we explore the generalization characteristics of unsupervised representation learning by leveraging disentangled VAE's to learn a useful latent space on a set of relational reasoning problems derived from Raven Progressive Matrices. We show that the latent representations, learned by unsupervised training …
A disentangled representation encodes information about the salient factors of variation in the data independently. Although it is often argued that this representational format is useful in learning to solve many real-world down-stream tasks, there is little empirical evidence that supports this claim. In this paper, …
Raven's Progressive Matrices are one of the widely used tests in evaluating the human test taker's fluid intelligence. Analogously, this paper introduces geometric generalization based zero-shot learning tests to measure the rapid learning ability and the internal consistency of deep generative models. Our empirical re…
RAVEN improves weak-to-strong generalization under distribution shifts.
RAVEN-UCB addresses non-stationary MAB problems with tighter regret bounds.
Survey on strong convergence in random matrices and its applications.
New methods link Calabi-Yau metrics to random matrices.
We develop an algorithm for systematic design of a large artificial neural network using a progression property. We find that some non-linear functions, such as the rectifier linear unit and its derivatives, hold the property. The systematic design addresses the choice of network size and regularization of parameters. …
In recent years, structured matrix recovery problems have gained considerable attention for its real world applications, such as recommender systems and computer vision. Much of the existing work has focused on matrices with low-rank structure, and limited progress has been made matrices with other types of structure. …
A new algorithm avoids retractions to optimize orthogonal matrices efficiently.
Deep kernel processes unify various models using Gram matrices and kernel functions.
There has been much recent progress in forecasting the next observation of a linear dynamical system (LDS), which is known as the improper learning, as well as in the estimation of its system matrices, which is known as the proper learning of LDS. We present an approach to proper learning of LDS, which in spite of the …
We review recent progress in modeling credit risk for correlated assets. We start from the Merton model which default events and losses are derived from the asset values at maturity. To estimate the time development of the asset values, the stock prices are used whose correlations have a strong impact on the loss distr…
We propose an efficient method for approximating natural gradient descent in neural networks which we call Kronecker-Factored Approximate Curvature (K-FAC). K-FAC is based on an efficiently invertible approximation of a neural network's Fisher information matrix which is neither diagonal nor low-rank, and in some cases…
In this article, we investigate when the set of primitive geodesic lengths on a Riemannian manifold have arbitrarily long arithmetic progressions. We prove that in the space of negatively curved metrics, a metric having such arithmetic progressions is quite rare. We introduce almost arithmetic progressions, a coarsific…
Gradient descent achieves exact linear convergence rate for symmetric matrix completion.
Dual PC algorithm improves structure learning of Bayesian networks.
Despite excellent progress in recent years, mode collapse remains a major unsolved problem in generative adversarial networks (GANs).In this paper, we present spectral regularization for GANs (SR-GANs), a new and robust method for combating the mode collapse problem in GANs. Theoretical analysis shows that the optimal …
New method solves nonsmooth low-rank matrix optimization problems efficiently.
The paper analyzes stability and generalization of shallow neural networks using gradient methods.
Industry evolution caused by various reasons, among which technology progress driving industry development has been approved, but with the new trend of industry convergence, inter-industry convergence also plays an increasing important role. This paper plans to probe the industry synergetic evolution mechanism based on…
Randomized algorithms that base iteration-level decisions on samples from some pool are ubiquitous in machine learning and optimization. Examples include stochastic gradient descent and randomized coordinate descent. This paper makes progress at theoretically evaluating the difference in performance between sampling wi…
Paper introduces a new curriculum generation method for reinforcement learning.
Lie groups applied to tech progress in economic growth.
Few-shot visual reasoning model learns analogical relationships from small data.
This paper improves disentanglement in VAEs by progressively learning hierarchical representations.
Bayesian model identifies health disparities in disease progression.
New algorithm outperforms existing ones by focusing on mastering rate.
The purpose of this paper relies on the study of long term yield curves modeling. Inspired by the economic litterature, it provides a financial interpretation of the Ramsey rule that links discount rate and marginal utility of aggregate optimal consumption. For such a long maturity modelization, the possibility of adju…
In this article, we prove that every arithmetic locally symmetric orbifold of classical type without Euclidean or compact factors has arbitrarily long arithmetic progressions in its primitive length spectrum. Moreover, we show the stronger property that every primitive length occurs in arbitrarily long arithmetic progr…
A variation of the preferential attachment random graph model of Barabási and Albert is defined that incorporates planted communities. The graph is built progressively, with new vertices attaching to the existing ones one-by-one. At every step, the incoming vertex is randomly assigned a label, which represents a commun…
The concept of progress has characterized human society from millennia. However, this concept is elusive and too often given for certain. The goal of this paper is to suggest a general definition of human progress that satisfies, whenever possible the conditions of independence, generality, epistemological applicabilit…
Survey of recent progress in Sasakian geometry.
This work designs an active world model learning system with progress-based curiosity.
Difficult image segmentation problems, for instance left atrium MRI, can be addressed by incorporating shape priors to find solutions that are consistent with known objects. Nonetheless, a single multivariate Gaussian is not an adequate model in cases with significant nonlinear shape variation or where the prior distri…
Study uses machine learning and survival analysis to predict CKD progression.
We introduce a novel approach for predicting the progression of adolescent idiopathic scoliosis from 3D spine models reconstructed from biplanar X-ray images. Recent progress in machine learning have allowed to improve classification and prognosis rates, but lack a probabilistic framework to measure uncertainty in the …
We simplify matrix computations for block matrices, especially useful for covariance and correlation matrices.
Minimal submanifolds in matrix spaces proven for specific ranks.
Low-rank modeling generally refers to a class of methods that solve problems by representing variables of interest as low-rank matrices. It has achieved great success in various fields including computer vision, data mining, signal processing and bioinformatics. Recently, much progress has been made in theories, algori…
Clinical researchers use disease progression models to understand patient status and characterize progression patterns from longitudinal health records. One approach for disease progression modeling is to describe patient status using a small number of states that represent distinctive distributions over a set of obser…
3BASiL-TM decomposes LLMs into sparse and low-rank matrices for efficient compression.
Study finds little progress in medical machine learning benchmarks over 3 years.
Alzheimer's Disease (AD) is characterized by a cascade of biomarkers becoming abnormal, the pathophysiology of which is very complex and largely unknown. Event-based modeling (EBM) is a data-driven technique to estimate the sequence in which biomarkers for a disease become abnormal based on cross-sectional data. It can…
Computes isotropy subgroups of orthogonal matrices acting on Hermitian matrices.