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

Trend · papers per month

326496128 · May 202619922001200920172026
48 results for essence invariants

New invariants measure how far spanning surfaces are from being compressible.

problem Understanding how essential spanning surfaces are in 3-manifolds.
method Introducing algebraic and geometric essence invariants, proving plumbing respects algebraic essence, and extending results to arbitrary 3-manifolds.
result Plumbing respects the algebraic essence of spanning surfaces, extending Ozawa's theorem.

Given two metrics of positive scalar curvature metrics on a closed spin manifold, there is a secondary index invariant in real KK-theory. There exist two definitions of this invariant, one of homotopical flavour, the other one defined by a index problem of Atiyah-Patodi-Singer type. We give a complete and detailed pro…

2013-08-22abs ↗pdf ↗

We construct a geometric, real analytic parametrization of the Hitchin component Hit_n(S) of the PSL_n(R)-character variety R_{PSL_n(R)}(S) of a closed surface S. The approach is explicit and constructive. In essence, our parametrization is an extension of Thurston's shear coordinates for the Teichmueller space of a cl…

2012-09-16abs ↗pdf ↗

Developed new Crofton formulas for pseudo-Riemannian spaces.

problem Computing volumes and curvature integrals in pseudo-Riemannian space forms.
method Introduced Crofton formulas using distributions and Alesker's Radon transform.
result Explicit Crofton formulas for all isometry-invariant valuations on pseudo-Riemannian spaces.

Thermalizer stabilizes autoregressive models for long-term predictions in chaotic systems.

problem Long-term predictions in chaotic spatiotemporal systems are unreliable due to trajectory divergence.
method Diffusion models are used to implicitly estimate the score of an invariant measure, which stabilizes autoregressive emulators by applying denoising during inference.
result Thermalization extends the time horizon of stable predictions by an order of magnitude in chaotic systems.

CGRL improves graph neural networks' OOD generalization by blocking spurious correlations.

problem Graph Neural Networks struggle with out-of-distribution data due to learning spurious correlations.
method Formulates a causal graph, uses backdoor adjustment, and introduces a loss replacement strategy.
result Significantly improves OOD generalization of GNNs, stabilizing mutual information learning.

Manifold learning seeks a low dimensional representation that faithfully captures the essence of data. Current methods can successfully learn such representations, but do not provide a meaningful set of operations that are associated with the representation. Working towards operational representation learning, we endow…

2019-08-20abs ↗pdf ↗

A new framework decouples SSL tasks into VDA and VLC, revealing VDA's importance.

problem Designing effective self-supervised learning tasks without manual annotation.
method Borrowing a multi-view perspective, the paper decouples popular pretext tasks into VDA and VLC, focusing on VDA's role in feature learning.
result VDA tasks dominate SSL performance, and integrating predictions from augmented views improves overall performance.

We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and simple and it follows from a direct application of Blackwell's approachability theorem to carefully chosen vector-valued payoff function and …

2009-12-18abs ↗pdf ↗

The main goal of the paper is to solve some problems about shadow for the sphere generalized on the case of the ellipsoid. Here, the essence of the problem is to find the the minimal number of non-overlapping balls with centers on the sphere which are not holding the center of the sphere and such that every line passin…

2015-10-07abs ↗pdf ↗

In this paper we present a novel quasi-Newton algorithm for use in stochastic optimisation. Quasi-Newton methods have had an enormous impact on deterministic optimisation problems because they afford rapid convergence and computationally attractive algorithms. In essence, this is achieved by learning the second-order (…

2019-09-03abs ↗pdf ↗

Convolutional Neural Networks, as most artificial neural networks, are commonly viewed as methods different in essence from kernel-based methods. We provide a systematic translation of Convolutional Neural Networks (ConvNets) into their kernel-based counterparts, Convolutional Kernel Networks (CKNs), and demonstrate th…

2019-03-19abs ↗pdf ↗

Large deep neural networks are powerful, but exhibit undesirable behaviors such as memorization and sensitivity to adversarial examples. In this work, we propose mixup, a simple learning principle to alleviate these issues. In essence, mixup trains a neural network on convex combinations of pairs of examples and their …

2017-10-25abs ↗pdf ↗

CLEAR learns causal graphs from attention in recommender systems to explain user behavior.

problem Understanding why specific recommendations are made in recommender systems.
method CLEAR learns session-specific causal graphs from attention in pre-trained neural recommenders, addressing latent confounders.
result CLEAR provides counterfactual explanations that are shorter and more effective than naive methods.

We study the problem of explaining a rich class of behavioral properties of deep neural networks. Distinctively, our influence-directed explanations approach this problem by peering inside the network to identify neurons with high influence on a quantity and distribution of interest, using an axiomatically-justified in…

2018-02-11abs ↗pdf ↗

To each knot KS3K\subset S^3 one can associated its knot Floer homology HFK^(K)\hat{HFK}(K), a finitely generated bigraded abelian group. In general, the nonzero ranks of these homology groups lie on a finite number of slope one lines with respect to the bigrading. The width of the homology is, in essence, the largest horizo…

2007-09-05abs ↗pdf ↗

We present a new methodology to analyze large classes of (classical and rough) stochastic volatility models, with special regard to short-time and small noise formulae for option prices. Our main tool is the theory of regularity structures, which we use in the form of [Bayer et al; A regularity structure for rough vola…

2018-11-01abs ↗pdf ↗

The paper tackles three financial issues: time resolution, nonstationarity, and latent factors.

problem Three fundamental issues in financial data: time resolution, nonstationarity, and latent factors.
method A causal perspective to reexamine and solve these issues.
result Provides systematic solutions to financial data issues.

This paper provides mathematical foundations for regression methods used in forward initial margin approximation.

problem Developing robust methods for approximating forward initial margin.
method Introduces mathematical rigor to show that regression methods are variations of approximating the conditional expectation function.
result Each regression method is a numerical estimation of the conditional expectation with a different functional form.

Globalization is one of the central concepts of our age. The common perception of the process is that, due to declining communication and transport costs, distance becomes less and less important. However, the distance coefficient in the gravity model of trade, which grows in time, indicates that the role of distance i…

2014-09-21abs ↗pdf ↗

Due to the extremely volatile nature of financial markets, it is commonly accepted that stock price prediction is a task full of challenge. However in order to make profits or understand the essence of equity market, numerous market participants or researchers try to forecast stock price using various statistical, econ…

2018-05-29abs ↗pdf ↗

As technology become more advanced, those who design, use and are otherwise affected by it want to know that it will perform correctly, and understand why it does what it does, and how to use it appropriately. In essence they want to be able to trust the systems that are being designed. In this survey we present assura…

2017-08-01abs ↗pdf ↗

Variational Laplace improves Bayesian neural network performance without sampling.

problem Improving Bayesian neural network performance and calibration.
method Develops a new variational Laplace method for BNNs, exploiting curvature of likelihood.
result Variational Laplace outperforms standard VI methods in test performance and calibration.

In life-cycle economics the Samuelson paradigm (Samuelson, 1969) states that the optimal investment is in constant proportions out of lifetime wealth composed of current savings and the present value of future income. It is well known that in the presence of credit constraints this paradigm no longer applies. Instead, …

2018-01-03abs ↗pdf ↗

This paper examines foreign exchange risk premia from simple univariate regressions to the state-space method. The adjusted traditional regressions properly figure out the existence and time-evolving property of the risk premia. Successively, the state-space estimations overall are quite rationally competent in examini…

2016-05-25abs ↗pdf ↗

We study the task of unsupervised domain adaptation, where no labeled data from the target domain is provided during training time. To deal with the potential discrepancy between the source and target distributions, both in features and labels, we exploit a copula-based regression framework. The benefits of this approa…

2017-09-29abs ↗pdf ↗

Rapid improvements in machine learning over the past decade are beginning to have far-reaching effects. For communications, engineers with limited domain expertise can now use off-the-shelf learning packages to design high-performance systems based on simulations. Prior to the current revolution in machine learning, th…

2019-01-22abs ↗pdf ↗

This work takes up the challenges of utility maximization problem when the market is indivisible and the transaction costs are included. First there is a so-called solvency region given by the minimum margin requirement in the problem formulation. Then the associated utility maximization is formulated as an optimal swi…

2010-03-15abs ↗pdf ↗

Transformer models align words through attention weights, closely approximating Optimal Transport.

problem Understanding the internal mechanism of transformer models in language processing.
method Empirical evidence and theoretical analysis of attention weights and their relation to Optimal Transport.
result Transformer models can simulate gradient descent on the dual of entropy-regularized OT problem, providing a theoretical foundation for token alignment.