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

61123184245 · Jun 202019922001200920172026
48 results for vicinal domains

Proposes novel losses for fine-grained categorical domain adaptation.

problem Fine-grained alignment of categories across domains in unsupervised domain adaptation.
method Joint category-domain classifier with adversarial training losses for both domain and category levels, and vicinal domain adaptation.
result Achieves state-of-the-art performance on benchmark datasets.

The vicinal risk minimization (VRM) principle, first proposed by \citet{vapnik1999nature}, is an empirical risk minimization (ERM) variant that replaces Dirac masses with vicinal functions. Although there is strong numerical evidence showing that VRM outperforms ERM if appropriate vicinal functions are chosen, a compre…

2018-11-11abs ↗pdf ↗

LGV boosts adversarial attacks by improving surrogate models.

problem Improving the transferability of black-box adversarial attacks.
method LGV uses a pretrained surrogate model and multiple weight sets from additional training epochs to generate an effective surrogate ensemble.
result LGV outperforms other test-time transformations by significant margins.

Adversarial training is an effective methodology for training deep neural networks that are robust against adversarial, norm-bounded perturbations. However, the computational cost of adversarial training grows prohibitively as the size of the model and number of input dimensions increase. Further, training against less…

2019-07-04abs ↗pdf ↗

Improved simulation of phase transitions using hierarchical autoregressive networks.

problem Simulating phase transitions in complex systems.
method Hierarchical Autoregressive Neural (HAN) network sampling algorithm.
result Significant improvement in statistical uncertainty compared to the Wolff cluster algorithm.

TIER uses extended strain data to improve gravitational wave detection sensitivity.

problem Improving gravitational wave detection sensitivity using extended strain data.
method TIER framework using machine learning to capture extended strain data features.
result Up to 20% improvement in sensitive volume time in LIGO-Virgo-Kagra O3 data.

We first show that the intrinsic, geometrical structure of a dynamical horizon is unique. A number of physically interesting constraints are then established on the location of trapped and marginally trapped surfaces in the vicinity of any dynamical horizon. These restrictions are used to prove several uniqueness theor…

2005-03-26abs ↗pdf ↗

After a review of the general properties of holomorphic spheres in complex surfaces we describe the local geometry in the vicinity of a CP^1 embedded with a negative normal bundle. As a by-product, we build (asymptotically locally hyperbolic) Kahler-Einstein metrics on the total spaces of the line bundles O(-m), m >= 3…

2013-07-10abs ↗pdf ↗

Improves speech recognition in noisy environments using robust acoustic models.

problem Adverse environments with significant mismatch between training and test conditions.
method Theoretical analysis of data augmentation as vicinal risk minimization, using mixture of Gaussians to incorporate robust inductive bias.
result Waveform-based approach shows 150% relative improvement in out-of-distribution generalization.

In [5], a rigidity result was obtained for outermost marginally outer trapped surfaces (MOTSs) that do not admit metrics of positive scalar curvature. This allowed one to treat the "borderline case" in the author's work with R. Schoen concerning the topology of higher dimensional black holes [8]. The proof of this rigi…

2017-12-06abs ↗pdf ↗

Paper improves training physics-informed neural networks with model ensembles.

problem Training physics-informed neural networks (PINNs) is difficult due to convergence to wrong solutions.
method Proposes training an ensemble of PINNs, using ensemble agreement to expand the solution interval.
result Algorithm stabilizes PINN training and yields competitive performance.

This work incorporates the multi-modality of the data distribution into a Gaussian Process regression model. We approach the problem from a discriminative perspective by learning, jointly over the training data, the target space variance in the neighborhood of a certain sample through metric learning. We start by using…

2018-03-19abs ↗pdf ↗

The econophysics approach to socio-economic systems is based on the assumption of their complexity. Such assumption inevitably lead to another assumption, namely that underlying interconnections within socio-economic systems, particularly financial markets, are nonlinear, which is shown to be true even in mainstream ec…

2014-03-09abs ↗pdf ↗

CcGAN tackles conditional image generation for continuous labels.

problem Mathematical challenges in conditioning on continuous, scalar labels.
method Proposes novel empirical losses and label input methods for continuous conditional GANs.
result CcGAN generates diverse, high-quality images from continuous labels.

Generative algorithms learn high-dimensional data efficiently and generate new samples.

problem Learning from scarce high-dimensional data.
method Lipschitz-regularized gradient flows and particle-based algorithms.
result Correctly transports gene expression data points with high dimensionality.

This thesis discusses the Newtonian limit of General Relativity for static isolated systems with compactly supported matter. We call these systems "geometrostatic" to underline their geometric nature. We introduce new quasi-local notions of mass and center of mass that can be read off locally in the vicinity of the mat…

2012-01-26abs ↗pdf ↗

Marine buoys aid in the battle against Illegal, Unreported and Unregulated (IUU) fishing by detecting fishing vessels in their vicinity. Marine buoys, however, may be disrupted by natural causes and buoy vandalism. In this paper, we formulate marine buoy placement as a clustering problem, and propose dropout k-means an…

2020-01-02abs ↗pdf ↗

Many nonparametric regressors were recently shown to converge at rates that depend only on the intrinsic dimension of data. These regressors thus escape the curse of dimension when high-dimensional data has low intrinsic dimension (e.g. a manifold). We show that k-NN regression is also adaptive to intrinsic dimension. …

2011-10-19abs ↗pdf ↗

This paper improves diffusion models for low-dimensional data.

problem Theoretical foundations of diffusion models are lacking for low-dimensional data.
method Score approximation, estimation, and distribution recovery of diffusion models on low-dimensional data.
result Sample complexity bounds for distribution estimation using diffusion models are provided.

We analyze a class of conical G_2 metrics admitting two commuting isometries, together with a certain one-parameter family of G_2 deformations which preserves these symmetries. Upon using recent results of Calderbank and Pedersen, we write down the explicit G_2 metric for the most general member of this family and extr…

2002-05-08abs ↗pdf ↗

The study analyzes how many neurons are needed for two-layer neural networks trained with gradient descent.

problem Determining the minimum number of neurons required for effective training of shallow neural networks.
method Analyzes two-layer neural networks in the NTK regime, trained with gradient descent. Derives fast rates of convergence and tracks the number of hidden neurons required for generalization.
result Derives fast rates of convergence and improves on existing results for the number of hidden neurons needed for generalization.

This work creates a system for understanding human movement in spaces.

problem Simplify communication and interaction between robots and humans in spatial tasks.
method Uses unsupervised learning with neural autoencoding to learn continuous representations of spatio-temporal trajectory data.
result Proposes a method to form prototypical representations of movement based on spatial context.

We propose a new class of learning algorithms that combines variational approximation and Markov chain Monte Carlo (MCMC) simulation. Naive algorithms that use the variational approximation as proposal distribution can perform poorly because this approximation tends to underestimate the true variance and other features…

2013-01-10abs ↗pdf ↗

In this paper, we treat the problem of evaluating the asymptotic error in a numerical integration scheme as one with inherent uncertainty. Adding to the growing field of probabilistic numerics, we show that Gaussian process regression (GPR) can be embedded into a numerical integration scheme to allow for (i) robust sel…

2019-05-23abs ↗pdf ↗

Representation learning has recently been successfully used to create vector representations of entities in language learning, recommender systems and in similarity learning. Graph embeddings exploit the locality structure of a graph and generate embeddings for nodes which could be words in a language, products of a re…

2019-08-21abs ↗pdf ↗

Entropy-based GP adaptive design improves failure probability estimation.

problem Limited accuracy in failure probability estimation due to model evaluation costs.
method Entropy-based Gaussian process (GP) adaptive design combined with multifidelity importance sampling (MFIS).
result More accurate failure probability estimates and higher confidence.

Study of convergence of point-object configurations to a charged dust continuum.

problem Understanding the convergence of discretized point-object configurations to a charged dust continuum.
method Establishing existence and uniqueness of horizons/minimal surfaces, studying geometries of regions exterior to minimal surfaces, and discussing limits.
result Examples of scalar curvature jumps upon taking Gromov-Hausdorff and intrinsic flat limits.

Policy gradient converges to globally optimal policy in nearly linear-quadratic systems.

problem Finding optimal policies in nonlinear control systems with partial information.
method Policy gradient algorithm designed for nearly linear-quadratic regulators with small Lipschitz nonlinear components.
result Policy gradient algorithm converges to globally optimal policy with linear rate.

State-of-the-art classifiers have been shown to be largely vulnerable to adversarial perturbations. One of the most effective strategies to improve robustness is adversarial training. In this paper, we investigate the effect of adversarial training on the geometry of the classification landscape and decision boundaries…

2018-11-23abs ↗pdf ↗