New adaptive test for NPIV models controls size and has superior power.
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
We construct a two parameter family of eleven-dimensional indecomposable Cahen-Wallach spaces with irreducible, non-flat, non-restricted geometric supersymmetry of fraction . Its compactified moduli space can be parametrized by a compact interval with two points corresponding to two non-isometric, decom…
Proposes a parametric t-SNE without perplexity tuning.
A new parametric method studies Willmore flows and energy quantization.
We propose a discrete surface theory in that unites the most prevalent versions of discrete special parametrizations. This theory encapsulates a large class of discrete surfaces given by a Lax representation and, in particular, the one-parameter associated families of constant curvature surfaces. The theo…
Paper relaxes assumptions for non-parametric estimation in pairwise learning.
Neural network training is usually accomplished by solving a non-convex optimization problem using stochastic gradient descent. Although one optimizes over the networks parameters, the main loss function generally only depends on the realization of the neural network, i.e. the function it computes. Studying the optimiz…
Noether's theorem clarifies how symmetries in neural networks influence learning.
Conditional restricted Boltzmann machines are undirected stochastic neural networks with a layer of input and output units connected bipartitely to a layer of hidden units. These networks define models of conditional probability distributions on the states of the output units given the states of the input units, parame…
In this paper, we give a general time-varying parameter model, where the multidimensional parameter possibly includes jumps. The quantity of interest is defined as the integrated value over time of the parameter process . We provide a local parametric estimator (LPE) of and conditions u…
For any Engel 4-fold, we show that the scanning map from the space of Engel knots to the space of formal Engel knots is a weak homotopy equivalence when restricted to the complement of the orbits of the Engel kernel. This is a relative, parametric and close h-principle.
In this paper, we prove a similar result to the fundamental theorem of regular surfaces in classical differential geometry, which extends the classical theorem to the entire class of singular surfaces in Euclidean 3-space known as frontals. Also, we characterize in a simple way these singular surfaces and its fundament…
Consider a multi-variate time series where which may represent spike train responses for multiple neurons in a brain, crime event data across multiple regions, and many others. An important challenge associated with these time series models is to estimate an influence network be…
Improved MLE for Hawkes Processes stabilizes unstable optimization.
Deep learning depends on tuning layers near critical points.
Paper presents a new framework for covariance matrix estimation with geometric insights.
A new graphical model for discrete data without parametric restrictions.
Extends DeTEcT framework for token economies with dynamic and probabilistic parameters.
Algorithms for Gaussian process, marginal likelihood methods or restricted maximum likelihood methods often require derivatives of log determinant terms. These log determinants are usually parametric with variance parameters of the underlying statistical models. This paper demonstrates that, when the underlying matrix …
Develops a flexible model for regime transitions in time series data.
We provide a framework to approximate the 2-Wasserstein distance and the optimal transport map, amenable to efficient training as well as statistical and geometric analysis. With the quadratic cost and considering the Kantorovich dual form of the optimal transportation problem, the Brenier theorem states that the optim…
Non-parametric bootstrap improves robust portfolio and trading strategy optimization.
Develops a new model for network estimation from multi-variate data.
Recent studies utilize multiple kernel learning to deal with incomplete-data problem. In this study, we introduce new methods that do not only complete multiple incomplete kernel matrices simultaneously, but also allow control of the flexibility of the model by parameterizing the model matrix. By imposing restrictions …
We propose an efficient method for estimating covariate effects in doubly-stochastic spatial models.
We study the problem of empirical minimization for variance-type functionals over functional classes. Sharp non-asymptotic bounds for the excess variance are derived under mild conditions. In particular, it is shown that under some restrictions imposed on the functional class fast convergence rates can be achieved incl…
Event sequences can be modeled by temporal point processes (TPPs) to capture their asynchronous and probabilistic nature. We propose an intensity-free framework that directly models the point process distribution by utilizing normalizing flows. This approach is capable of capturing highly complex temporal distributions…
The method of covariate adjustment is often used for estimation of population average treatment effects in observational studies. Graphical rules for determining all valid covariate adjustment sets from an assumed causal graphical model are well known. Restricting attention to causal linear models, a recent article der…
We provide an approach for learning deep neural net representations of models described via conditional moment restrictions. Conditional moment restrictions are widely used, as they are the language by which social scientists describe the assumptions they make to enable causal inference. We formulate the problem of est…
Many machine learning problems can be expressed as the optimization of some cost functional over a parametric family of probability distributions. It is often beneficial to solve such optimization problems using natural gradient methods. These methods are invariant to the parametrization of the family, and thus can yie…
In classical Hawkes process, the baseline intensity and triggering kernel are assumed to be a constant and parametric function respectively, which limits the model flexibility. To generalize it, we present a fully Bayesian nonparametric model, namely Gaussian process modulated Hawkes process and propose an EM-variation…
Generative moment matching networks (GMMNs) are introduced for generating quasi-random samples from multivariate models with any underlying copula in order to compute estimates under variance reduction. So far, quasi-random sampling for multivariate distributions required a careful design, exploiting specific propertie…
New method calibrates probabilistic regression models without restrictive assumptions.
In this paper we study rational real algebraic knots in . We show that two real algebraic knots of degree are rigidly isotopic if and only if their degrees and encomplexed writhes are equal. We also show that any irreducible smooth knot which admits a plane projection with less than or equal to four cro…
Machine learning uses invariant theory to restrict function classes.
This research adapts scoring rules for training survival models, improving predictive performance.
Estimates latent positions in 1D torus from noisy pairwise affinities.
Neural networks estimate SDEs with jump noise using a Tamed-Milstein scheme.
Paper proposes a policy gradient method for confounded POMDPs.
We propose a novel quantum model for the restricted Boltzmann machine (RBM), in which the visible units remain classical whereas the hidden units are quantized as noninteracting fermions. The free motion of the fermions is parametrically coupled to the classical signal of the visible units. This model possesses a quant…
Bayesian model selection improves multivariate causal discovery without restrictive assumptions.
A new causal graph framework identifies treatment effects without adjusting for confounders.
Generalizes prediction-powered inference for binary classifier evaluation.
We compare two statistical models of three binary random variables. One is a mixture model and the other is a product of mixtures model called a restricted Boltzmann machine. Although the two models we study look different from their parametrizations, we show that they represent the same set of distributions on the int…
We study the risk of minimum-norm interpolants of data in Reproducing Kernel Hilbert Spaces. Our upper bounds on the risk are of a multiple-descent shape for the various scalings of , , for the input dimension and sample size . Empirical evidence supports our finding that minimum-norm interpo…
We propose a Bayesian non-parametric approach for modeling the distribution of multiple returns. In particular, we use an asymmetric dynamic conditional correlation (ADCC) model to estimate the time-varying correlations of financial returns where the individual volatilities are driven by GJR-GARCH models. The ADCC-GJR-…
The paper develops efficient estimators for semi-parametric binary models in distributed computing.
Conditional density estimation is a general framework for solving various problems in machine learning. Among existing methods, non-parametric and/or kernel-based methods are often difficult to use on large datasets, while methods based on neural networks usually make restrictive parametric assumptions on the probabili…