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.

169,181 papers · 148 categories

Trend · papers per month

9.0%18.0%27.0%36.0% · May 202619922001200920182026
48 results for inaccurate parameter estimates

Improved learning of relational models from partial network data.

problem Inaccurate parameter estimates for relational models from network samples.
method Stochastic gradient descent for relational logistic regression from partial network crawls.
result Accurate parameter estimates and confidence intervals achieved.

A new method reduces dimensionality for better likelihood-free parameter estimation.

problem Estimating parameters from data with no closed-form likelihood.
method Combines reconstruction map estimation with dimension-reduction techniques.
result The proposed method outperforms existing techniques in accuracy and efficiency.

Two simulation-based methods improve optimal sampling design in systems biology.

problem Optimal selection of sampling points for accurate parameter estimation in dynamical systems.
method E-optimal-ranking (EOR) and LSTM neural network-based methods.
result Simulation studies show the proposed methods outperform random selection and classical E-optimal design.

SBI provides more accurate pole positions than chi-squared minimization in model misspecification.

problem Accurate pole position estimation in pi-pi scattering models.
method Simulation Based Inference (SBI) method compared to chi-squared minimization.
result SBI leads to more robust predictions of pole positions in models of pi-pi scattering.

New method improves simulation-based inference by avoiding model misspecification.

problem Inefficient parameter estimation for models with intractable likelihoods.
method Proposes a robust SNL method with additional adjustment parameters.
result Demonstrates more accurate point estimates and uncertainty quantification.

The study examines how many samples are needed to minimize a noisy convex function with inaccurate gradient estimates.

problem Determining the number of samples needed to minimize a noisy convex function with inaccurate gradient estimates.
method Using Stochastic Convex Optimization as a case study, the study analyzes the relationship between the number of samples and the accuracy of gradient estimates.
result The study provides partial answers to the question, showing that a general analyst requires Ω(1/ε3)Ω(1/ε^3) samples and that under certain assumptions, ildeΩ(1/ε2.5) ilde Ω(1/ε^{2.5}) samples are necessary for gradient descent to interact with the oracle.

Enhances reinforcement learning uncertainty estimation with a generalized Gaussian error model.

problem Inaccurate error representations and compromised uncertainty estimation in conventional uncertainty-aware TD learning.
method Introduces a novel framework for generalized Gaussian error modeling in deep reinforcement learning, incorporating higher-order moments, particularly kurtosis, to improve uncertainty estimation and mitigation.
result Significant performance gains in policy gradient algorithms with the proposed framework.

Unified method for inference on partially identified causal effects using covariates.

problem Partial identification of causal effects due to unobserved joint potential outcomes.
method Model-agnostic approach using duality theory for optimal transport problems.
result Uniformly valid inference for a wide class of estimands, even with inaccurate nuisance parameter estimates.

Privacy preserving mechanisms such as differential privacy inject additional randomness in the form of noise in the data, beyond the sampling mechanism. Ignoring this additional noise can lead to inaccurate and invalid inferences. In this paper, we incorporate the privacy mechanism explicitly into the likelihood functi…

2015-11-24abs ↗pdf ↗

New bounds for sampling algorithms without log-concavity assumptions.

problem Sampling high-dimensional probability measures without log-concavity assumptions.
method Euler discretisation of SDEs with novel convergence rates and coupling construction.
result Explicit L2L^2 convergence rates and non-asymptotic bounds for sampling algorithms.

We study the value of information in sequential compressed sensing by characterizing the performance of sequential information guided sensing in practical scenarios when information is inaccurate. In particular, we assume the signal distribution is parameterized through Gaussian or Gaussian mixtures with estimated mean…

2015-09-01abs ↗pdf ↗

Incorporating domain knowledge into the modeling process is an effective way to improve learning accuracy. However, as it is provided by humans, domain knowledge can only be specified with some degree of uncertainty. We propose to explicitly model such uncertainty through probabilistic constraints over the parameter sp…

2012-05-09abs ↗pdf ↗

Paper uses robust GMM to reconstruct missing data in Sentinel-2 images for crop monitoring.

problem Missing data in remote sensing images, especially from multispectral and SAR sensors.
method Robust Gaussian Mixture Models (GMM) with outlier detection using isolation forest.
result Robust GMM outperforms standard GMM in reconstructing imputed values, reducing errors.

Neural networks estimate spatial process likelihoods efficiently.

problem Challenges in estimating spatial processes with slow or intractable likelihoods.
method Convolutional neural networks trained on a classification task to learn likelihood function.
result Neural likelihood surfaces provide fast and accurate parameter estimation.

Study proposes method to estimate causal effects from noisy treatment data.

problem Estimating causal effects from noisy treatment data without side information.
method Deep latent variable model with neural network parameterization and amortized importance-weighted variational objective.
result Causal effect estimates are identifiable without side information and measurement error variance knowledge.

New normalization method makes neural networks more robust to adversarial attacks.

problem Adversarial vulnerability of BatchNorm in deep neural networks.
method Identified distribution shift caused by adversarial images, proposed RobustNorm to use inference-time statistics.
result RobustNorm makes models more robust to adversarial attacks without sacrificing BatchNorm benefits.

Accurate statistical models of neural spike responses can characterize the information carried by neural populations. But the limited samples of spike counts during recording usually result in model overfitting. Besides, current models assume spike counts to be Poisson-distributed, which ignores the fact that many neur…

2016-05-10abs ↗pdf ↗

Study reveals why polls were inaccurate in 2016 US election.

problem Why opinion polls were inaccurate in 2016 US election.
method Proposes clean sensing framework for optimal parameter estimation from heterogeneous data sources.
result Optimal polling strategy allocates resources based on data quality and quantity.

While the authors of Batch Normalization (BN) identify and address an important problem involved in training deep networks-- \textit{Internal Covariate Shift}-- the current solution has certain drawbacks. For instance, BN depends on batch statistics for layerwise input normalization during training which makes the esti…

2015-05-21abs ↗pdf ↗

Popular interpretability methods often produce inaccurate feature importance estimates.

problem Inaccurate feature importance estimates in deep neural networks.
method Empirical measure of feature importance accuracy across large-scale image classification datasets.
result Only certain ensemble-based methods (VarGrad and SmoothGrad-Squared) outperform random assignment of feature importance.

Develops new methods to evaluate data influence in SAM for improved model training.

problem Challenges in mislabeled noisy data and privacy concerns in SAM.
method Two innovative data valuation methods based on influence functions (IF) for SAM.
result Demonstrates effectiveness in identifying mislabeled data and enhancing interpretability.

Paper proposes hybrid machine learning for tuning first principles models in engineering systems.

problem Inaccurate first principles models in process engineering due to changing conditions.
method Hybrid machine learning framework using Bayesian Neural Networks.
result Uncertainty estimates improve operation decisions in multiphase flow modeling.

A new method improves graph-based semi-supervised classification by removing noise and mixed signs.

problem Inaccurate soft labels and noise in graph-based semi-supervised classification.
method Triple-matrix-recovery-based robust auto-weighted label propagation framework (ALP-TMR).
result Improved robustness to noise and outliers in label estimation.

New techniques improve the accuracy of identifying nonlinear systems from noisy data.

problem Identifying nonlinear dynamical systems from noisy state measurements.
method Comparative study of local and global smoothing techniques to denoise state measurements and improve sparse regression methods.
result Global smoothing methods outperform local methods in improving the accuracy of governing equation recovery.

DC-NAS improves neural architecture search by clustering and evaluating sub-networks.

problem Inaccurate evaluation of neural architectures in large search spaces.
method Divide-and-Conquer approach: feature representation, clustering, and evaluation of clusters.
result Achieved 75.1% top-1 accuracy on ImageNet, surpassing state-of-the-art methods.

New method improves causal effect estimation by addressing imbalance in training data.

problem Imbalance between treatment and control groups in training data.
method Combines distributionally robust optimization and weight regularization.
result Consistent improvements over existing methods in experiments.