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

Trend · papers per month

4386129172 · Jun 202019922001200920172026
48 results for parametric restrictions

New adaptive test for NPIV models controls size and has superior power.

problem Testing inequality and equality restrictions in nonparametric IV models.
method Adaptive hypothesis test based on modified leave-one-out sample quadratic distance.
result Adaptive test attains the adaptive minimax rate of testing in L2L^{2}.

We construct a two parameter family of eleven-dimensional indecomposable Cahen-Wallach spaces with irreducible, non-flat, non-restricted geometric supersymmetry of fraction ν=34ν=\tfrac{3}{4}. Its compactified moduli space can be parametrized by a compact interval with two points corresponding to two non-isometric, decom…

2014-06-18abs ↗pdf ↗

We propose a discrete surface theory in R3\mathbb R^3 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…

2014-12-23abs ↗pdf ↗

Paper relaxes assumptions for non-parametric estimation in pairwise learning.

problem Generalization performance of non-parametric estimation for pairwise learning.
method Significantly relaxes restrictive assumptions, constructs structured deep ReLU neural network, and designs targeted hypothesis space.
result Establishes a sharp oracle inequality for empirical minimizer with general hypothesis space for Lipschitz continuous pairwise losses.

Noether's theorem clarifies how symmetries in neural networks influence learning.

problem Understanding how symmetries in neural networks affect learning.
method Systematic study of symmetry interactions with learning algorithms using Noether's theorem.
result Symmetries impose restrictions on the optimization path, leading to conserved quantities.

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 Θ=T10TθtdtΘ= T^{-1} \int_0^T θ_t^* dt. We provide a local parametric estimator (LPE) of ΘΘ and conditions u…

2016-03-17abs ↗pdf ↗

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.

2017-10-30abs ↗pdf ↗

Consider a multi-variate time series (Xt)t=0T(X_t)_{t=0}^{T} where XtRdX_t \in \mathbb{R}^d 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…

2018-01-23abs ↗pdf ↗

Paper presents a new framework for covariance matrix estimation with geometric insights.

problem Challenges in covariance matrix estimation, especially in finding suitable models and efficient estimation methods.
method General framework for linear restrictions on different transformations of the covariance matrix, including matrix logarithm and its inverse.
result Yields an MM-estimator with MM-estimation allowing for straightforward asymptotic and finite sample analysis.

Extends DeTEcT framework for token economies with dynamic and probabilistic parameters.

problem Modeling wealth distribution in token economies with dynamic and probabilistic parameters.
method Introduces four parametrization techniques: dynamic vs static, probabilistic vs non-probabilistic.
result Derives existing wealth distribution models from DeTEcT framework with added restrictions.

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 …

2019-11-02abs ↗pdf ↗

Non-parametric bootstrap improves robust portfolio and trading strategy optimization.

problem Mitigating uncertainty in expected returns and covariances in financial decision-making.
method Non-parametric bootstrap framework for robust optimization without distributional assumptions.
result Improved out-of-sample performance with smoother, more stable results.

Develops a new model for network estimation from multi-variate data.

problem Network estimation from multi-variate point process or time series data.
method Semi-parametric approach based on the monotone single-index multi-variate autoregressive model (SIMAM).
result Achieves optimal rates of convergence and superior performance in prediction and network estimation.

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 …

2018-04-17abs ↗pdf ↗

We propose an efficient method for estimating covariate effects in doubly-stochastic spatial models.

problem Computational demands and restrictive assumptions in existing doubly-stochastic spatial models.
method Penalized regression method for estimating covariate effects in doubly-stochastic point processes.
result Consistency and asymptotic normality of the covariate effect estimates achieved despite model misspecification.

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…

2019-10-18abs ↗pdf ↗

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…

2018-03-19abs ↗pdf ↗

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…

2019-10-21abs ↗pdf ↗

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…

2019-05-29abs ↗pdf ↗

New method calibrates probabilistic regression models without restrictive assumptions.

problem Ensuring predictive distributions accurately reflect true uncertainty.
method Nonparametric re-calibration algorithm based on conditional kernel mean embeddings.
result Consistently outperforms prior re-calibration approaches across various benchmarks.

In this paper we study rational real algebraic knots in RP3\R P^3. We show that two real algebraic knots of degree 5\leq5 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…

2009-05-26abs ↗pdf ↗

This research adapts scoring rules for training survival models, improving predictive performance.

problem Training survival models with traditional methods struggles with censoring.
method Adapting scoring rules for survival analysis, creating a flexible framework for model training.
result Scoring rules can be successfully incorporated into model training, yielding competitive performance.

Estimates latent positions in 1D torus from noisy pairwise affinities.

problem Estimating latent positions in a 1D torus from noisy pairwise affinities.
method Introduced an estimation procedure with provable localization error of O(log(n)/n)O(\sqrt{\log(n)/n}).
result The estimation procedure provably localizes latent positions with a maximum error of O(log(n)/n)O(\sqrt{\log(n)/n}).

Neural networks estimate SDEs with jump noise using a Tamed-Milstein scheme.

problem Estimating drift and diffusion functions in SDEs with jump noise.
method Tamed-Milstein scheme with neural networks as non-parametric approximators.
result Flexible estimation of complex nonlinear dynamics in systems with state-dependent noise.

Paper proposes a policy gradient method for confounded POMDPs.

problem Estimating policy gradients for confounded POMDPs with continuous state and observation spaces.
method Developed a novel identification result to estimate policy gradients using offline data, solved conditional moment restrictions, and applied min-max learning with function approximation.
result Showed global convergence of the proposed algorithm in finding the optimal policy.

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…

2020-01-24abs ↗pdf ↗

Bayesian model selection improves multivariate causal discovery without restrictive assumptions.

problem Real-world causal discovery requires flexible assumptions to avoid restrictive model assumptions.
method Continuous relaxation of discrete model selection problem, using Causal Gaussian Process Conditional Density Estimator (CGP-CDE).
result Bayesian approach outperforms traditional methods in multivariate causal discovery.

A new causal graph framework identifies treatment effects without adjusting for confounders.

problem Invalid identification of causal effects due to unmeasured confounders.
method Developed the Napkin graph to identify causal effects through a ratio of g-formulas, using influence-function-based estimators.
result Demonstrated substantial efficiency gains in estimating causal effects using the Napkin graph.

Generalizes prediction-powered inference for binary classifier evaluation.

problem Evaluation of binary classifiers with partially observed outcomes.
method Generalizes PPI to any regular asymptotically linear estimator and proposes modified estimators for covariate shift.
result PPI can be a computationally-simple alternative to existing methods, achieving no greater than the semi-parametric efficiency lower bound in certain scenarios.

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…

2017-09-15abs ↗pdf ↗

The paper develops efficient estimators for semi-parametric binary models in distributed computing.

problem Estimation and inference challenges in large-scale data under non-smooth objective functions.
method Proposes one-shot and multi-round divide-and-conquer estimators with adaptive kernel smoothing to relax constraints and achieve superlinear optimization error.
result Establishes quadratic convergence up to optimal statistical error rate and handles dataset heterogeneity and high-dimensional sparse parameters.

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…

2018-06-05abs ↗pdf ↗