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

Trend · papers per month

140280420560 · Jun 202019922001200920172026
48 results for distributional viewpoint

ViewFool identifies adversarial viewpoints to test image recognition robustness.

problem Lack of robustness to viewpoint changes in visual recognition models.
method Neural Radiance Fields (NeRF) and entropic regularizer to find adversarial viewpoints.
result Common image classifiers are highly vulnerable to generated adversarial viewpoints.

Risk measures applied to dynamic Markov processes with varying risk aversion.

problem Investigating dynamic risk measures in Markov decision processes with varying risk aversion.
method Distributional viewpoint on law-invariant convex risk measures, applied to Markov decision processes with latent costs and random actions.
result Existence of optimal policies in finite and infinite time horizons under mild assumptions.

Generative Adversarial Networks (GANs) were intuitively and attractively explained under the perspective of game theory, wherein two involving parties are a discriminator and a generator. In this game, the task of the discriminator is to discriminate the real and generated (i.e., fake) data, whilst the task of the gene…

2017-11-06abs ↗pdf ↗

There are multiple sides to every story, and while statistical topic models have been highly successful at topically summarizing the stories in corpora of text documents, they do not explicitly address the issue of learning the different sides, the viewpoints, expressed in the documents. In this paper, we show how thes…

2016-08-14abs ↗pdf ↗

Novel algorithms for entropic optimal transport from an optimisation perspective.

problem Solving the entropic-regularised optimal transport problem.
method Developed novel methods inspired by mirror descent, solving semi-dual problems or non-convex constrained problems over joint distributions.
result Non-asymptotic rates of convergence for the proposed methods under minimal assumptions.

The notion of a parallelizable distribution has been introduced and investigated. A non-integrable parallelizable distribution carries a natural sub-Riemannian structure. The geometry of this structure has been studied from the bi-viewpoint of absolute parallelism geometry and sub-Riemannian geometry. Two remarkable li…

2016-03-19abs ↗pdf ↗

AR-GANs learn depth and DoF from unlabeled images using aperture rendering and focus cues.

problem Learning depth and DoF from unlabeled natural images with diverse viewpoints and shapes.
method Aperture rendering and focus cues to learn depth and DoF from unlabeled images.
result AR-GANs effectively learn depth and DoF from various datasets, including flower, bird, and face images.

We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on which several probability distributions agree. Instead of minimizing an objective f…

2011-08-06abs ↗pdf ↗

This paper improves SGMs by using a predictor-corrector scheme to converge faster.

problem Theoretical and practical limitations of existing SGMs when T1oT_1 o \infty.
method Integrates a predictor-corrector scheme after the forward process to converge in finite time.
result Convergence guarantees for SGMs require only a fixed finite time T1T_1.

In this paper we construct two groupoids from morphisms of groupoids, with one from a categorical viewpoint and the other from a geometric viewpoint. We show that for each pair of groupoids, the two kinds of groupoids of morphisms are equivalent. Then we study the automorphism groupoid of a groupoid.

2017-12-14abs ↗pdf ↗

We present a probabilistic viewpoint to multiple kernel learning unifying well-known regularised risk approaches and recent advances in approximate Bayesian inference relaxations. The framework proposes a general objective function suitable for regression, robust regression and classification that is lower bound of the…

2011-03-04abs ↗pdf ↗

We study the problem of robustly estimating the posterior distribution for the setting where observed data can be contaminated with potentially adversarial outliers. We propose Rob-ULA, a robust variant of the Unadjusted Langevin Algorithm (ULA), and provide a finite-sample analysis of its sampling distribution. In par…

2019-07-27abs ↗pdf ↗

New approach to machine learning optimization using distribution space.

problem Optimization challenges in machine learning with non-convex constraints.
method Relaxation to convex optimization in distribution space, numerical algorithm based on mixture distributions.
result Approximate optimization in distribution space is consistent and effective.

This paper tackles catastrophic forgetting in neural networks by providing a unified framework for regularization-based continual learning.

problem Catastrophic forgetting in neural networks trained sequentially on multiple tasks.
method Formulates regularization-based continual learning as a second-order Taylor approximation of the loss function, leading to a unified framework.
result Theoretical results indicate the importance of accurate approximation of the Hessian matrix for optimization and generalization.

We consider a triality between the Zermelo navigation problem, the geodesic flow on a Finslerian geometry of Randers type, and spacetimes in one dimension higher admitting a timelike conformal Killing vector field. From the latter viewpoint, the data of the Zermelo problem are encoded in a (conformally) Painleve-Gullst…

2008-11-18abs ↗pdf ↗

Study invariant connections on multivariate Gaussian distributions.

problem Understanding statistical connections on multivariate Gaussian distributions.
method Investigate invariant connections on N0n\mathcal{N}_0^n with the Fisher metric.
result Explicitly determined invariant connections and their moduli spaces.

We describe a method to classify crystallographic tilings of the Euclidean and hyperbolic planes by tiles whose stabiliser group contains translation isometries or whose topology is not that of a closed disk. We tackle this problem from two different viewpoints, one with constructive techniques to enumerate such tiling…

2019-04-08abs ↗pdf ↗

This paper first presents a theory for generative adversarial methods that does not rely on the traditional minimax formulation. It shows that with a strong discriminator, a good generator can be learned so that the KL divergence between the distributions of real data and generated data improves after each functional g…

2018-01-19abs ↗pdf ↗

Bayesian inference problems require sampling or approximating high-dimensional probability distributions. The focus of this paper is on the recently introduced Stein variational gradient descent methodology, a class of algorithms that rely on iterated steepest descent steps with respect to a reproducing kernel Hilbert …

2019-12-02abs ↗pdf ↗

In multi-instance (MI) learning, each object (bag) consists of multiple feature vectors (instances), and is most commonly regarded as a set of points in a multidimensional space. A different viewpoint is that the instances are realisations of random vectors with corresponding probability distribution, and that a bag is…

2018-03-07abs ↗pdf ↗

We explore the perspective of a bug living on the two-dimensional surface of a polyhedron. Images of various kinds of effects like lensing and cloaking are shown via color pictures of three viewpoints: the first person perspective of the bug, a map of the bug's viewpoint, and a look at the bug on the embedded polyhedro…

2017-06-19abs ↗pdf ↗

We offer a graphical interpretation of unfairness in a dataset as the presence of an unfair causal path in the causal Bayesian network representing the data-generation mechanism. We use this viewpoint to revisit the recent debate surrounding the COMPAS pretrial risk assessment tool and, more generally, to point out tha…

2019-07-15abs ↗pdf ↗

In 1929, Paul Funk and Ludwig Berwald gave a characterization of Hilbert geometries from the Finslerian viewpoint. They showed that a smooth Finsler metric in a convex bounded domain of Rn\mathbb{R}^n is the Hilbert geometry in that domain if and only if it is complete, if its geodesics are straight lines and if its fl…

2013-11-11abs ↗pdf ↗

The purpose of this article is to present the theory of higher order connections on vector bundles from a viewpoint inspired by projective differential geometry.

2009-08-11abs ↗pdf ↗

Study optimizes step size for Metropolis algorithm in non-identifiable cases.

problem Optimizing step size for Metropolis algorithm in non-identifiable models.
method Analytical derivation of average acceptance rate for non-identifiable cases.
result Developed optimization principle for step size based on average acceptance rate.

The wave equation (free boson) problem is studied from the viewpoint of the relations on the symplectic manifolds associated to the boundary induced by solutions. Unexpectedly there is still something to say on this simple, well-studied problem. In particular, boundaries which do not allow for a meaningful Hamiltonian …

2013-08-26abs ↗pdf ↗

This paper focuses on a class of linear Hawkes processes with general immigrants. These are counting processes with shot noise intensity, including self-excited and externally excited patterns. For such processes, we introduce the concept of age pyramid which evolves according to immigration and births. The virtue if t…

2015-04-24abs ↗pdf ↗