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

216433649865 · Jun 202019922001200920172026
48 results for direct parameter estimation

DPERC efficiently estimates covariance matrices for mixed data with missing values.

problem Estimating covariance matrices for datasets with missing values and mixed features.
method Direct Parameter Estimation for Randomly Missing Data with Categorical Features (DPERC).
result DPERC outperforms other methods in estimating covariance matrices for mixed data with missing values.

This paper compares imputation and direct parameter estimation methods for missing data in correlation matrix visualization.

problem Missing data challenges in estimating correlation coefficients for accurate visualization.
method Comparison of imputation and direct parameter estimation methods for handling missing data.
result Direct parameter estimation (DPER) outperforms imputation for accurate correlation matrix visualization.

Develops a direct debiased machine learning framework using Bregman divergence.

problem Reduces bias in machine learning estimates of causal effects or structural models.
method Neyman targeted estimation and generalized Riesz regression using Bregman divergence.
result Improves estimation of parameters of interest in causal models.

We present a distributed (non-Bayesian) learning algorithm for the problem of parameter estimation with Gaussian noise. The algorithm is expressed as explicit updates on the parameters of the Gaussian beliefs (i.e. means and precision). We show a convergence rate of O(1/k)O(1/k) with the constant term depending on the numb…

2016-12-06abs ↗pdf ↗

Estimates causal effects using machine learning for binary treatment and mediator.

problem Estimating direct and indirect quantile treatment effects under selection-on-observables.
method Double/debiased machine learning estimators based on efficient score functions.
result Uniform consistency and asymptotic normality of effect estimators.

Paper tackles hyper-gradient estimation in decentralized FL over time-varying networks.

problem Excessive communication costs and inability to use robust networks.
method Introduces an optimality condition and uses Push-Sum for averaging model parameters and gradients over time-varying directed networks.
result Derives a hyper-gradient estimator that operates over time-varying directed networks and converges to the true hyper-gradient.

The modelling of data on a spherical surface requires the consideration of directional probability distributions. To model asymmetrically distributed data on a three-dimensional sphere, Kent distributions are often used. The moment estimates of the parameters are typically used in modelling tasks involving Kent distrib…

2015-06-26abs ↗pdf ↗

We propose directed time series regression, a new approach to estimating parameters of time-series models for use in certainty equivalent model predictive control. The approach combines merits of least squares regression and empirical optimization. Through a computational study involving a stochastic version of a well …

2012-06-26abs ↗pdf ↗

New algorithms estimate Jacobian matrices for large-scale machine learning.

problem Efficiently computing search directions for large nonlinear least squares.
method Exploit low-rank structure in Hessian to estimate Jacobian matrices.
result Two algorithms perform well compared to state-of-the-art methods.

Proposes a new estimator for causal mediation with continuous treatments.

problem Estimation of direct and indirect effects with continuous treatments.
method Kernel smoothing approach with cross-fitting for non-parametric estimation.
result Multiply robust and asymptotically normal estimator for continuous treatments.

We introduce the "NoBackTrack" algorithm to train the parameters of dynamical systems such as recurrent neural networks. This algorithm works in an online, memoryless setting, thus requiring no backpropagation through time, and is scalable, avoiding the large computational and memory cost of maintaining the full gradie…

2015-07-28abs ↗pdf ↗

Paper efficiently infers differential parameters in time-varying models using time score matching.

problem Efficiently inferring differential parameters in time-varying probabilistic models.
method Directly estimates the differential parameter using time score matching and proves consistency of the method.
result Consistent estimation of parameter derivatives in high-dimensional settings.

A new method optimizes neural sequence models for better task performance.

problem Training neural sequence models with maximum likelihood estimation ignores task losses.
method Maximum likelihood guided parameter search (MGS) in the parameter space.
result MGS optimizes sequence-level losses, reducing repetition and non-termination.

Parametric images provide insight into the spatial distribution of physiological parameters, but they are often extremely noisy, due to low SNR of tomographic data. Direct estimation from projections allows accurate noise modeling, improving the results of post-reconstruction fitting. We propose a method, which we name…

2018-03-27abs ↗pdf ↗

Direct approach for handling contextual bandits with latent state dynamics.

problem Handling contextual bandits with latent state dynamics, especially when rewards depend on posterior probabilities of hidden states.
method Direct reduction to standard linear contextual bandits, extended analysis of HMM parameters, periodic update of reward-model parameters.
result Periodic update of reward-model parameters allows handling complex dependencies in hidden states.

Novel approach for SEM in small samples with p>np>n.

problem Small sample size and p>np>n issues in factor-based SEM.
method Reformulates covariance structure into self-covariance and cross-covariance, defines a feasible set with relative error constraint.
result Improved stability and directional information in small-sample settings.

Proposes a new measure to evaluate stability of statistical parameters under distributional shifts.

problem Difficulty in transferring knowledge across data sets due to distributional changes.
method Introduces a measure of instability quantifying sensitivity of statistical parameters to Kullback-Leibler divergence and directional shifts.
result The proposed measure can elucidate the type of shifts a parameter is sensitive to and improve estimation accuracy under shifted distributions.

Estimates parameters in max-linear Bayesian networks with noise.

problem Causal inference in extreme-value settings with noise parameters.
method Max-plus algebra and logarithm transformation, normal distribution estimation, EM algorithm and quadratic optimization.
result An estimator of a parameter for each edge in a DAG is normally distributed.

IGNIS uses neural networks to estimate copula parameters robustly.

problem Pathological properties of Archimedean copulas make traditional estimators brittle.
method Unified neural estimation framework with multi-input architecture and softplus output layer.
result Accurate and stable estimates for real-world datasets.

Policy gradient methods in reinforcement learning update policy parameters by taking steps in the direction of an estimated gradient of policy value. In this paper, we consider the statistically efficient estimation of policy gradients from off-policy data, where the estimation is particularly non-trivial. We derive th…

2020-02-10abs ↗pdf ↗

A new method recovers latent potentials from graph flows, preserving ordering and stability.

problem Recovering latent potentials from graph flows is ill-posed and standard methods collapse the ordering.
method Gauge-invariant, parameter-insensitive regularization using Dirichlet energy.
result The method preserves ordering and stability across different regularization strengths.

Gibbs sampling is a workhorse for Bayesian inference but has several limitations when used for parameter estimation, and is often much slower than non-sampling inference methods. SAME (State Augmentation for Marginal Estimation) \cite{Doucet99,Doucet02} is an approach to MAP parameter estimation which gives improved pa…

2014-09-18abs ↗pdf ↗

Paper estimates Hurst parameter from implied volatilities.

problem Estimating Hurst parameter from implied volatilities.
method Uses covariance between asset return and realized volatility, and applies limit theorems for stochastic volatility models.
result Direct relation between covariance and slope of at-the-money implied volatility established.

New meta-learning method improves domain generalization by balancing parameters closer to domain centroids.

problem Improving domain generalization by reducing overfitting to specific domains.
method Arithmetic meta-learning with arithmetic-weighted gradients to balance parameters closer to domain centroids.
result Experimental validation of improved domain generalization performance.

Algorithm identifies Pareto front using multiple context directions and reuses exploration samples.

problem Identifying a set of arms with undominated mean reward vectors in linear bandits.
method Proposes a new estimator that updates estimates along multiple context directions and reuses exploration samples.
result Optimal sample complexity and logarithmic regret compared to optimal algorithms.

Study identifies parameters in causal models with latent confounding.

problem Parameter identification in linear non-Gaussian causal models with latent confounding.
method Graphical criterion for necessary and sufficient identifiability of direct causal effects, with polynomial-time algorithm.
result Developed a graphical criterion for identifying direct causal effects in latent variable models with arbitrary non-linear confounding.

This work simplifies Bayesian inference for neural networks by identifying influential parameter directions.

problem High computational complexity in Bayesian inference for neural networks due to high-dimensional parameter space.
method Constructing an active subspace of influential parameter directions to reduce dimensionality.
result Effective and scalable Bayesian inference achieved via reduced active subspace.

Directed acyclic graphs (DAGs) are a popular framework to express multivariate probability distributions. Acyclic directed mixed graphs (ADMGs) are generalizations of DAGs that can succinctly capture much richer sets of conditional independencies, and are especially useful in modeling the effects of latent variables im…

2010-08-31abs ↗pdf ↗

This paper analyzes quantiles of heavy-tailed distributions, separating projection direction and quantile threshold effects.

problem Analyzing quantiles of heavy-tailed distributions with estimated parameters.
method Introduces a Q-Q orthogonality formulation to separate projection-direction and quantile-threshold effects.
result Decomposes the difference between empirical and population quantiles into three terms.

New IDS algorithm refines parameter norm bounds for better bandit performance.

problem Frequentist IDS requires tight norm bounds, which are often unavailable in practice.
method Iteratively refines a high-probability upper bound on true parameter norm using data.
result Regret bounds independent of assumed parameter norm, outperforming state-of-the-art algorithms.

Log-linear models are the popular workhorses of analyzing contingency tables. A log-linear parameterization of an interaction model can be more expressive than a direct parameterization based on probabilities, leading to a powerful way of defining restrictions derived from marginal, conditional and context-specific ind…

2014-09-09abs ↗pdf ↗

In stochastic gradient descent, especially for neural network training, there are currently dominating first order methods: not modeling local distance to minimum. This information required for optimal step size is provided by second order methods, however, they have many difficulties, starting with full Hessian having…

2019-07-16abs ↗pdf ↗

Estimates high-dimensional posterior densities by marginal distributions and neural networks.

problem High-dimensional probability density estimation for inference is difficult.
method Direct estimation of lower-dimensional marginal distributions, using Moment Networks for fast computation of moments.
result Demonstrates estimation of gravitational wave time series and applications in cosmology.

Optimal neural network approximation for Wasserstein gradient direction via convex optimization.

problem Approximating Wasserstein gradient direction with limited data.
method Two-layer networks with squared-ReLU activations, SDP relaxation.
result Optimal approximation of Wasserstein gradient direction in two-layer networks.