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

2468 · Jun 201919922001200920172026
48 results for breakthroughs

We study kk-SVD that is to obtain the first kk singular vectors of a matrix AA. Recently, a few breakthroughs have been discovered on kk-SVD: Musco and Musco [1] proved the first gap-free convergence result using the block Krylov method, Shamir [2] discovered the first variance-reduction stochastic method, and Bhoj…

2016-07-12abs ↗pdf ↗

Recently, there have been several breakthroughs in the classification of tight contact structures. We give an outline on how to exploit methods developed by Ko Honda and John Etnyre to obtain classification results for specific examples of small Seifert manifolds.

2002-01-11abs ↗pdf ↗

Coding theory is a central discipline underpinning wireline and wireless modems that are the workhorses of the information age. Progress in coding theory is largely driven by individual human ingenuity with sporadic breakthroughs over the past century. In this paper we study whether it is possible to automate the disco…

2018-05-23abs ↗pdf ↗

Recent advances in Reinforcement Learning, grounded on combining classical theoretical results with Deep Learning paradigm, led to breakthroughs in many artificial intelligence tasks and gave birth to Deep Reinforcement Learning (DRL) as a field of research. In this work latest DRL algorithms are reviewed with a focus …

2019-06-24abs ↗pdf ↗

This work establishes a new upper bound on the number of samples sufficient for PAC learning in the realizable case. The bound matches known lower bounds up to numerical constant factors. This solves a long-standing open problem on the sample complexity of PAC learning. The technique and analysis build on a recent brea…

2015-07-02abs ↗pdf ↗

This short expository note gives an elementary introduction to the study of dynamics on certain moduli spaces, and in particular the recent breakthrough result of Eskin, Mirzakhani, and Mohammadi. We also discuss the context and applications of this result, and connections to other areas of mathematics such as algebrai…

2015-04-30abs ↗pdf ↗

New energy identity found for biharmonic maps into spheres.

problem Establishing energy identity for biharmonic maps in supercritical dimensions.
method Adapting Lin-Rivière's strategy for sphere-valued maps.
result Energy identity for stationary biharmonic maps into spheres in supercritical dimensions n5n\ge 5.

A major breakthrough in the theory of topological algorithms occurred in 1992 when Hyam Rubinstein introduced the idea of an almost normal surface. We explain how almost normal surfaces emerged naturally from the study of geodesics and minimal surfaces. Patterns of stable and unstable geodesics can be used to character…

2012-08-02abs ↗pdf ↗

We provide the first information theoretic tight analysis for inference of latent community structure given a sparse graph along with high dimensional node covariates, correlated with the same latent communities. Our work bridges recent theoretical breakthroughs in the detection of latent community structure without no…

2018-07-23abs ↗pdf ↗

Generative Adversarial Networks (Goodfellow et al., 2014), a major breakthrough in the field of generative modeling, learn a discriminator to estimate some distance between the target and the candidate distributions. This paper examines mathematical issues regarding the way the gradients for the generative model are co…

2018-07-03abs ↗pdf ↗

For an nn-dimensional polytope ΩΩ in Rn\mathbb{R}^{n}, we study lower bounds for eigenvalues of the Dirichlet eigenvalue problem of the Laplacian. In the asymptotic formula on the average of the first kk eigenvalues, Li and Yau (1983) obtained the first term with the order k2nk^{\frac2n}, which is optimal. The next l…

2012-08-26abs ↗pdf ↗

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 ↗

Lecture notes on using non-Archimedean geometry for complex variety degenerations.

problem Complex algebraic variety degenerations with non-Archimedean Berkovich spaces.
method Hybrid spaces and non-Archimedean pluripotential theory.
result Relation between convergence of psh metrics and Monge-Ampere measures in hybrid spaces.

New dropout technique reduces variance and overestimation in deep Q-Learning.

problem Reduction of variance and overestimation in deep Q-Learning.
method Using Dropout techniques to reduce variance and overestimation in deep Q-Learning.
result Demonstrated effectiveness in enhancing stability and reducing both variance and overestimation.

Survey on recent breakthrough linking curvature and Kobayashi hyperbolicity.

problem Connecting curvature properties to Kobayashi hyperbolicity in complex geometry.
method Detailed analysis of Wu-Yau theorem and its proof.
result A compact complex manifold with negative holomorphic sectional curvature admits a Kähler metric with negative Ricci curvature.

Self-attention prefers sparse functions of input sequences, reducing sample complexity.

problem Understanding the inductive biases of self-attention in modeling long-range dependencies.
method Theoretical analysis and synthetic experiments to probe sample complexity of learning sparse functions with Transformers.
result Bounded-norm Transformer networks can represent sparse functions of the input sequence with logarithmic sample complexity.

The recently suggested tangle calculus for knot polynomials is intimately related to topological string considerations and can help to build the HOMFLY-PT invariants from the topological vertices. We discuss this interplay in the simplest example of the Hopf link and link L8n8L_{8n8}. It turns out that the resolved conif…

2018-06-04abs ↗pdf ↗

Recent breakthroughs in computer vision make use of large deep neural networks, utilizing the substantial speedup offered by GPUs. For applications running on limited hardware, however, high precision real-time processing can still be a challenge. One approach to solving this problem is training networks with binary or…

2017-10-21abs ↗pdf ↗

Monte-Carlo Tree Search (MCTS) methods are drawing great interest after yielding breakthrough results in computer Go. This paper proposes a Bayesian approach to MCTS that is inspired by distributionfree approaches such as UCT [13], yet significantly differs in important respects. The Bayesian framework allows potential…

2012-03-15abs ↗pdf ↗

We show that a certain geometric property, the QSF introduced by S. Brick and M. Mihalik, is universally true for {\ibf all} finitely presented groups ΓΓ. One way of defining this property is the existence of a smooth compact manifold MM with π1M=Γπ_1 M = Γ, such that M~\tilde M is geometrically simply-connected ({\it i…

2007-11-22abs ↗pdf ↗