Approximate Maximum Likelihood Inference for Acoustic Spatial Capture-Recapture with Unknown Identities, Using Monte Carlo Expectation Maximization

• URL: http://arxiv.org/abs/2410.04390v1
• Date: Sun, 6 Oct 2024 08:06:15 GMT
• Title: Approximate Maximum Likelihood Inference for Acoustic Spatial Capture-Recapture with Unknown Identities, Using Monte Carlo Expectation Maximization
• Authors: Yuheng Wang, Juan Ye, Weiye Li, David L. Borchers,
• Abstract summary: We propose a Monte Carlo expectation-maximization estimation method to resolve the unknown call identity problem. We apply our method to a survey of moss frogs, and it gives an estimate within 15% of the estimate obtained using data with call capture histories constructed by experts.
• Score: 2.0519694663895627
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Acoustic spatial capture-recapture (ASCR) surveys with an array of synchronized acoustic detectors can be an effective way of estimating animal density or call density. However, constructing the capture histories required for ASCR analysis is challenging, as recognizing which detections at different detectors are of which calls is not a trivial task. Because calls from different distances take different times to arrive at detectors, the order in which calls are detected is not necessarily the same as the order in which they are made, and without knowing which detections are of the same call, we do not know how many different calls are detected. We propose a Monte Carlo expectation-maximization (MCEM) estimation method to resolve this unknown call identity problem. To implement the MCEM method in this context, we sample the latent variables from a complete-data likelihood model in the expectation step and use a semi-complete-data likelihood or conditional likelihood in the maximization step. We use a parametric bootstrap to obtain confidence intervals. When we apply our method to a survey of moss frogs, it gives an estimate within 15% of the estimate obtained using data with call capture histories constructed by experts, and unlike this latter estimate, our confidence interval incorporates the uncertainty about call identities. Simulations show it to have a low bias (6%) and coverage probabilities close to the nominal 95% value.

Related papers

• Mitigating LLM Hallucinations via Conformal Abstention [70.83870602967625]
  We develop a principled procedure for determining when a large language model should abstain from responding in a general domain. We leverage conformal prediction techniques to develop an abstention procedure that benefits from rigorous theoretical guarantees on the hallucination rate (error rate) Experimentally, our resulting conformal abstention method reliably bounds the hallucination rate on various closed-book, open-domain generative question answering datasets.
  arXiv  Detail & Related papers  (2024-04-04T11:32:03Z)
• All Thresholds Barred: Direct Estimation of Call Density in Bioacoustic Data [1.7916003204531015]
  We propose a validation scheme for estimating call density in a body of data. We use these distributions to predict site-level densities, which may be subject to distribution shifts.
  arXiv  Detail & Related papers  (2024-02-23T14:52:44Z)
• Conservative Prediction via Data-Driven Confidence Minimization [70.93946578046003]
  In safety-critical applications of machine learning, it is often desirable for a model to be conservative. We propose the Data-Driven Confidence Minimization framework, which minimizes confidence on an uncertainty dataset.
  arXiv  Detail & Related papers  (2023-06-08T07:05:36Z)
• Composed Image Retrieval with Text Feedback via Multi-grained Uncertainty Regularization [73.04187954213471]
  We introduce a unified learning approach to simultaneously modeling the coarse- and fine-grained retrieval. The proposed method has achieved +4.03%, +3.38%, and +2.40% Recall@50 accuracy over a strong baseline.
  arXiv  Detail & Related papers  (2022-11-14T14:25:40Z)
• Concrete Score Matching: Generalized Score Matching for Discrete Data [109.12439278055213]
  "Concrete score" is a generalization of the (Stein) score for discrete settings. "Concrete Score Matching" is a framework to learn such scores from samples.
  arXiv  Detail & Related papers  (2022-11-02T00:41:37Z)
• Partial Identification with Noisy Covariates: A Robust Optimization Approach [94.10051154390237]
  Causal inference from observational datasets often relies on measuring and adjusting for covariates. We show that this robust optimization approach can extend a wide range of causal adjustment methods to perform partial identification. Across synthetic and real datasets, we find that this approach provides ATE bounds with a higher coverage probability than existing methods.
  arXiv  Detail & Related papers  (2022-02-22T04:24:26Z)
• An algorithm-based multiple detection influence measure for high dimensional regression using expectile [0.4999814847776096]
  We propose an algorithm-based, multi-step, multiple detection procedure to identify influential observations. Our three-step algorithm to identify and capture undesirable variability in the data, $asymMIP,$ is based on two complementary statistics. The application of our method to the Autism Brain Imaging Data Exchange dataset resulted in a more balanced and accurate prediction of brain maturity.
  arXiv  Detail & Related papers  (2021-05-26T01:16:24Z)
• Quantifying Ignorance in Individual-Level Causal-Effect Estimates under Hidden Confounding [38.09565581056218]
  We study the problem of learning conditional average treatment effects (CATE) from high-dimensional, observational data with unobserved confounders. We present a new parametric interval estimator suited for high-dimensional data.
  arXiv  Detail & Related papers  (2021-03-08T15:58:06Z)
• Model-based multi-parameter mapping [0.0]
  Quantitative MR imaging is increasingly favoured for its richer information content and standardised measures. Estimations often assume noise subsets of data to solve for different quantities in isolation. Instead, a generative model can be formulated and inverted to jointly recover parameter estimates.
  arXiv  Detail & Related papers  (2021-02-02T17:00:11Z)
• Variable Skipping for Autoregressive Range Density Estimation [84.60428050170687]
  We show a technique, variable skipping, for accelerating range density estimation over deep autoregressive models. We show that variable skipping provides 10-100$times$ efficiency improvements when targeting challenging high-quantile error metrics.
  arXiv  Detail & Related papers  (2020-07-10T19:01:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.