Paper introduces a novel measure to analyze excess error in classification under covariate shift.
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.
Trend · papers per month
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…
New approach improves model robustness and calibration in latent space.
Proposes novel losses for fine-grained categorical domain adaptation.
ML4C uses binary classification to infer causal structures from latent vicinity.
TIER uses extended strain data to improve gravitational wave detection sensitivity.
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…
We find numerical and empirical evidence for dynamical, structural and topological phase transitions on the (German) Frankfurt Stock Exchange (FSE) in the temporal vicinity of the worldwide financial crash. Using the Minimal Spanning Tree (MST) technique, a particularly useful canonical tool of the graph theory, two tr…
Paper explores VRM for PSMLC with partially labeled medical images.
In this article we construct a smooth Euler flow supported in a neighborhood of a helix. It may be considered a generalization of a similar solution found by the author for a circle.
Improves speech recognition in noisy environments using robust acoustic models.
LGV boosts adversarial attacks by improving surrogate models.
Introduces a framework using information theory for understanding machine learning.
Pattern ensembling fills in missing or inaccurate trajectory data.
We derive bounds on the distribution function, therefore also on the Value-at-Risk, of where is an aggregation function and is a random vector with known marginal distributions and partially known dependence structure. More specifically, we analyze three type…
Paper improves training physics-informed neural networks with model ensembles.
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…
Improved simulation of phase transitions using hierarchical autoregressive networks.
Many image processing tasks involve image-to-image mapping, which can be addressed well by fully convolutional networks (FCN) without any heavy preprocessing. Although empirically designing and training FCNs can achieve satisfactory results, reasons for the improvement in performance are slightly ambiguous. Our study i…
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…
Policy gradient converges to globally optimal policy in nearly linear-quadratic systems.
A framework compares image representations based on local geometry.
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…
A method for authorship attribution based on function word adjacency networks (WANs) is introduced. Function words are parts of speech that express grammatical relationships between other words but do not carry lexical meaning on their own. In the WANs in this paper, nodes are function words and directed edges stand in…
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…
Machine learning maps knots to embeddings, revealing topological invariants.
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…
Predicting traffic incident duration is a major challenge for many traffic centres around the world. Most research studies focus on predicting the incident duration on motorways rather than arterial roads, due to a high network complexity and lack of data. In this paper we propose a bi-level framework for predicting th…
Decentralized framework for spatial data inference over vulnerabilities.
We address one of the crucial aspects necessary for safe and efficient operations of autonomous vehicles, namely predicting future state of traffic actors in the autonomous vehicle's surroundings. We introduce a deep learning-based approach that takes into account a current world state and produces raster images of eac…
SBA improves neural network generalization by dynamically augmenting data.
CcGAN tackles conditional image generation for continuous labels.
Variable selection for Gaussian process models is often done using automatic relevance determination, which uses the inverse length-scale parameter of each input variable as a proxy for variable relevance. This implicitly determined relevance has several drawbacks that prevent the selection of optimal input variables i…
Stochastic kernel based dimensionality reduction approaches have become popular in the last decade. The central component of many of these methods is a symmetric kernel that quantifies the vicinity between pairs of data points and a kernel-induced Markov chain on the data. Typically, the Markov chain is fully specified…
Generative algorithms learn high-dimensional data efficiently and generate new samples.
A fundamental problem arising in many areas of machine learning is the evaluation of the likelihood of a given observation under different nominal distributions. Frequently, these nominal distributions are themselves estimated from data, which makes them susceptible to estimation errors. We thus propose to replace each…
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…
Study dynamics and topology of flows near non-saddle sets or W-sets.
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. …
This paper improves diffusion models for low-dimensional data.
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…
CNN detects phase transitions in Potts models without prior knowledge.
A number of optimization approaches have been proposed for optimizing nonconvex objectives (e.g. deep learning models), such as batch gradient descent, stochastic gradient descent and stochastic variance reduced gradient descent. Theory shows these optimization methods can converge by using an unbiased gradient estimat…
In this paper we build a link between the Teichmuller theory of hyperbolic Riemann surfaces and isomonodromic deformations of linear systems whose monodromy group is the Fuchsian group associated to the given hyperbolic Riemann surface by the Poincare' uniformization. In the case of a one-sheeted hyperboloid with n orb…
The study analyzes how many neurons are needed for two-layer neural networks trained with gradient descent.
This work improves interpretability and calibration of complex-valued neural networks using Newton-Puiseux analysis.
ELBO of VAEs converges to a sum of three entropies.
This work creates a system for understanding human movement in spaces.