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

Trend · papers per month

3186369541,272 · Jun 202019922001200920182026
48 results for Bird Observational Data

Bird sounds possess distinctive spectral structure which may exhibit small shifts in spectrum depending on the bird species and environmental conditions. In this paper, we propose using convolutional recurrent neural networks on the task of automated bird audio detection in real-life environments. In the proposed metho…

2017-03-07abs ↗pdf ↗

Bird sound data collected with unattended microphones for automatic surveys, or mobile devices for citizen science, typically contain multiple simultaneously vocalizing birds of different species. However, few works have considered the multi-label structure in birdsong. We propose to use an ensemble of classifier chain…

2013-04-22abs ↗pdf ↗

Understanding how species are distributed across landscapes over time is a fundamental question in biodiversity research. Unfortunately, most species distribution models only target a single species at a time, despite strong ecological evidence that species are not independently distributed. We propose Deep Multi-Speci…

2016-09-28abs ↗pdf ↗

Study evaluates self-supervised representations in interactive environments.

problem Unclear which self-supervised methods best capture meaningful features of diverse environments.
method Quantitative evaluation of representations in two visual environments: Flappy Bird and Sonic The Hedgehog.
result Representations' utility depends on the visuals and dynamics of the environment.

Develops counterfactual visual explanations to show how images could change to classify differently.

problem Creating understandable explanations for vision system predictions.
method Selects a distractor image and identifies spatial regions to modify for different classification.
result Users trained with counterfactual explanations perform better in fine-grained bird classification.

Concept bottleneck models enable concept manipulation for model interpretation.

problem Training models to directly predict labels without intermediate concepts.
method Train models to predict intermediate concepts at training time, then use these concepts to predict labels.
result Concept bottleneck models achieve competitive accuracy with standard models while enabling concept manipulation.

A networked learning method for correlated data outperforms federated learning in precision.

problem Estimating models from correlated data distributed across a network.
method Local linear model estimation with network regularization and information exchange.
result The weighted ensemble average estimate converges faster and more precisely than federated learning.

StatEcoNet models species distribution using neural networks to correct observation errors.

problem Correcting observation errors in wildlife surveys for accurate species distribution modeling.
method StatEcoNet integrates a graphical generative model with neural networks to address SDM challenges.
result StatEcoNet outperforms traditional methods on simulated and real datasets.

The Collective Graphical Model (CGM) models a population of independent and identically distributed individuals when only collective statistics (i.e., counts of individuals) are observed. Exact inference in CGMs is intractable, and previous work has explored Markov Chain Monte Carlo (MCMC) and MAP approximations for le…

2014-05-20abs ↗pdf ↗

This text is intended to become in the long run Chapter 3 of our long saga dedicated to Riemann, Ahlfors and Rohlin. Yet, as its contents evolved as mostly independent (due to our inaptitude to interconnect both trends as strongly as we wished), it seemed preferable to publish it separately. More factually, our account…

2013-10-07abs ↗pdf ↗

Reinforcement learning methods require careful design involving a reward function to obtain the desired action policy for a given task. In the absence of hand-crafted reward functions, prior work on the topic has proposed several methods for reward estimation by using expert state trajectories and action pairs. However…

2018-06-02abs ↗pdf ↗

New framework learns interaction rules from animal trajectories.

problem Challenges in extracting interaction rules from animal movement data.
method Augmented behavioral models with neural networks and theory-guided regularization.
result Improved performance over baselines and novel biological insights.

LFlows model fluid densities and velocities using invertible maps that satisfy the continuity equation.

problem Modeling fluid densities and velocities continuously in space and time.
method LFlows are based on invertible maps that satisfy the continuity equation, derived from classical theory of Lagrangian flows for smooth vector fields.
result LFlows show higher predictive accuracy in density modeling tasks compared to competing models in 2D and 3D.

AR-GANs learn depth and DoF from unlabeled images using aperture rendering and focus cues.

problem Learning depth and DoF from unlabeled natural images with diverse viewpoints and shapes.
method Aperture rendering and focus cues to learn depth and DoF from unlabeled images.
result AR-GANs effectively learn depth and DoF from various datasets, including flower, bird, and face images.

In this work, we derive a generic overcomplete frame thresholding scheme based on risk minimization. Overcomplete frames being favored for analysis tasks such as classification, regression or anomaly detection, we provide a way to leverage those optimal representations in real-world applications through the use of thre…

2017-12-25abs ↗pdf ↗

MPVAE learns latent embeddings and label correlations for multi-label classification.

problem Challenging task of predicting multiple targets with label correlations.
method Proposes MPVAE, a novel framework that learns latent embedding spaces and label correlations using a Multivariate Probit model.
result MPVAE outperforms state-of-the-art methods on various application domains and is robust under noisy settings.

Standard economic theory, starting with Adam Smith's invisible hand, holds that those who trade for their own selfish motives of maximizing their private preferences may contribute more to the public wealth than those who claim altruistic motives. Under restrictive conditions, this has been shown to result from a self-…

2005-10-09abs ↗pdf ↗

We propose prototypical networks for the problem of few-shot classification, where a classifier must generalize to new classes not seen in the training set, given only a small number of examples of each new class. Prototypical networks learn a metric space in which classification can be performed by computing distances…

2017-03-15abs ↗pdf ↗

New contest evaluates machine learning robustness against unrestricted adversarial examples.

problem Evaluating machine learning robustness against arbitrary adversarial inputs.
method Two-player contest with a prize pool, focusing on unconstrained adversarial examples.
result Demonstrates the need for comprehensive evaluation of machine learning models' worst-case adversarial risk.

EcoCast predicts biodiversity risks using satellite data and citizen science records.

problem Unprecedented shifts in species distributions due to climate change and habitat loss.
method Spatio-temporal model using sequence-based transformers and continual learning.
result Promising improvements in forecasting bird species distributions compared to Random Forest.

Learning high quality class representations from few examples is a key problem in metric-learning approaches to few-shot learning. To accomplish this, we introduce a novel architecture where class representations are conditioned for each few-shot trial based on a target image. We also deviate from traditional metric-le…

2018-02-12abs ↗pdf ↗

It is well known that most of the common clustering objectives are NP-hard to optimize. In practice, however, clustering is being routinely carried out. One approach for providing theoretical understanding of this seeming discrepancy is to come up with notions of clusterability that distinguish realistically interestin…

2015-10-19abs ↗pdf ↗

This paper improves confidence measurement in deep metric learning models.

problem Measuring confidence in deep metric learning models is challenging.
method Approximates class distributions using Gaussian kernel smoothing and calibrates the confidence metric.
result Improves generalization and robustness of deep metric learning models.

BiPE blends intra-segment and inter-segment encodings for better length extrapolation.

problem Improving length extrapolation in language models.
method Bilevel Positional Encoding (BiPE) that separates intra-segment and inter-segment encodings.
result BiPE enhances length extrapolation across various text modalities.

PointPainting fuses lidar and image data for better 3D object detection.

problem Lidar-only methods outperform fusion methods on 3D object detection benchmarks.
method Sequential fusion by projecting lidar points into image segmentation output and appending class scores.
result Significant improvements on state-of-the-art 3D object detection methods on KITTI and nuScenes datasets.

Improved road segmentation on low-res LIDAR data for autonomous vehicles.

problem Low-resolution LIDAR data affects road segmentation accuracy in autonomous vehicles.
method Subsampled LIDAR data transformation into feature maps, use local normal vector with spherical coordinates.
result Improves road segmentation accuracy on low-resolution LIDAR data.

C4Synth generates images from multiple captions to improve image quality.

problem Generating images from a single caption is limited; multiple captions are needed.
method Two deep generative models that ensure 'Cross-Caption Cycle Consistency'.
result Quantitative and qualitative validation on Caltech-UCSD Birds and Oxford-102 Flowers datasets.

Proposes a new method to describe graph vertex features using characteristic functions.

problem Describing the distribution of vertex features at multiple scales on graphs.
method Introduces FEATHER, a computationally efficient algorithm to calculate characteristic functions based on random walk transition probabilities.
result Demonstrates that the proposed method creates high-quality graph representations and is robust to data corruption.