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

Trend · papers per month

6351,2691,9042,538 · Jun 202019922001200920172026
48 results for search and rescue

Proposes a new Hawkes process bandit model for disaster search and rescue.

problem Forecasting and detecting spatio-temporal events with undersampled or biased data.
method Upper confidence bound algorithm using Bayesian spatial Hawkes process estimation.
result Model outperforms state-of-the-art spatial MAB algorithms in disaster search and rescue.

Improved person detection in occluded conditions with AOS images.

problem Inaccurate classification of partially occluded people, animals, or objects.
method Combining multi-perspective images captured by Airborne Optical Sectioning (AOS) to achieve better precision and recall.
result Precision/recall of 96/93% for automated person detection.

New method for rolling bodies on inclined planes, with applications to rescue operations.

problem Constructing solid bodies rolling along curves on inclined planes.
method Rigorous existence theorems and connections to maritime rescue operations.
result Comprehensive existence theorems for rolling bodies on inclined planes.

We analyze the possibility of reduction of systemic risk in financial markets through Pigouvian taxation of financial institutions which is used to support the rescue fund. We introduce the concept of the cascade risk with a clear operational definition as a subclass and a network related measure of the systemic risk. …

2014-06-23abs ↗pdf ↗

Study claims trading to rescue banks in distress.

problem Rescue a bank in distress using claims trading.
method Formalize claims trading in financial networks, study decision and optimization problems, provide efficient algorithms for creditor-positive trades.
result No trade can strictly improve both banks' assets; provide efficient algorithms for creditor-positive trades.

Algorithm improves resource allocation for food outreach to homeless.

problem Resource-constrained outreach for homeless individuals and food rescue.
method Thompson sampling with Markov chain recovery (via Stein variational gradient descent) for partially-observed episodic restless bandits.
result Significantly outperforms baselines in both organizations' problems.

InfoTree improves reinforcement learning by optimizing tool use with a greedy submodular approach.

problem Maximizing information from tool use in reinforcement learning with limited resources.
method Formalizes Rollout Informativeness, recasts state selection as submodular maximization, and uses UUCB and ABA.
result InfoTree outperforms existing methods across various benchmarks, improving performance by 18.2% on average.

In this paper, we investigate how to learn to control a group of cooperative agents with limited sensing capabilities such as robot swarms. The agents have only very basic sensor capabilities, yet in a group they can accomplish sophisticated tasks, such as distributed assembly or search and rescue tasks. Learning a pol…

2017-09-18abs ↗pdf ↗

Models predict fire and other emergencies in Edmonton.

problem Accurate prediction of emergency events for timely response.
method Data collection, descriptive analysis, feature selection, and negative binomial regression.
result Models perform well, with acceptable prediction errors for weekly and monthly periods.

A DRL-based strategy improves vehicle tracking accuracy while saving energy.

problem Enhancing vehicle tracking accuracy in WSNs without increasing energy consumption.
method Decentralized strategy with dynamic reinforcement learning to adjust sensing areas.
result Simulation results demonstrate superior performance of DRL-aided design.

Social learning can make financial markets inefficient, but individual learning can fix this.

problem Inefficiencies in financial markets due to social learning.
method Study of the Minority Game model with social and individual learning mechanisms.
result Individual learning can rescue a population from the inefficiencies caused by social learning.

New method improves neural spike train models by minimizing divergence directly, leading to better performance.

problem Poor performance and divergence issues in spike train models using maximum likelihood estimation.
method Directly minimize maximum mean discrepancy using spike train kernels and stochastic optimization.
result The proposed method generates well-behaved models with better control over feature trade-offs.

Efficient search methods can outperform random search on challenging tasks.

problem Comparing the performance of efficient and random search methods in neural architecture search.
method Comparison of weight sharing and random search methods on progressively larger search spaces for image classification and detection.
result Efficient search methods can provide substantial gains over random search on large, realistic tasks.

A new framework generates large hierarchical search spaces for neural architectures.

problem Discovering neural architectures from simple blocks is hard.
method Context-free grammars for a unified, scalable search space.
result Efficiently searches over complete architectures, outperforming existing methods.

Neural architecture search methods are able to find high performance deep learning architectures with minimal effort from an expert. However, current systems focus on specific use-cases (e.g. convolutional image classifiers and recurrent language models), making them unsuitable for general use-cases that an expert migh…

2019-09-30abs ↗pdf ↗

A new framework for optimizing interventions with limited data.

problem Small data, default intervention data, unmodeled objectives, unforeseen consequences.
method Bandit data-driven optimization combining online bandit learning and offline predictive analytics.
result PROOF algorithm achieves no-regret and superior performance in simulations and real-world application.

Approaches to learning Bayesian networks from data typically combine a scoring function with a heuristic search procedure. Given a Bayesian network structure, many of the scoring functions derived in the literature return a score for the entire equivalence class to which the structure belongs. When using such a scoring…

2013-02-13abs ↗pdf ↗

FiGS searches over a larger space of architectures for efficient mobile models.

problem Designing small, efficient deep networks for mobile devices.
method Differentiable search method using sparse regularization and Logistic-Sigmoid distribution.
result FiGS produces state-of-the-art parameter-efficient models on ImageNet and improves object detection performance.

This work proposes searching for optimal operation distribution in neural architecture search.

problem Finding optimal neural architecture with specific operations and connections.
method Search for the optimal operation distribution, providing a stochastic and approximate solution.
result Operation distribution holds enough discriminating power to reliably identify a solution and is easier to optimise than traditional encodings.

CrossBeam learns to search more efficiently in program synthesis.

problem Efficiently searching through vast program spaces.
method Trains a neural model to guide program synthesis, combining previously explored programs.
result CrossBeam explores much smaller portions of the program space compared to state-of-the-art methods.

Deep-n-Cheap automates deep learning model search for low complexity.

problem Finding efficient deep learning models for various datasets.
method Automated search framework for architecture and hyperparameters, including search transfer.
result Models offer comparable performance to state-of-the-art but are faster to train.

einspace expands NAS search space to include diverse neural architectures.

problem NAS results are often limited to existing structures; new designs are rare.
method einspace uses a probabilistic context-free grammar to create a versatile search space.
result einspace discovers novel and improved architectures, including convolutions and attention.

Automatic methods for Neural Architecture Search (NAS) have been shown to produce state-of-the-art network models. Yet, their main drawback is the computational complexity of the search process. As some primal methods optimized over a discrete search space, thousands of days of GPU were required for convergence. A rece…

2019-04-08abs ↗pdf ↗

We consider a framework for structured prediction based on search in the space of complete structured outputs. Given a structured input, an output is produced by running a time-bounded search procedure guided by a learned cost function, and then returning the least cost output uncovered during the search. This framewor…

2012-06-27abs ↗pdf ↗

Method predicts disease outbreaks using search logs, overcoming instability.

problem Predicting disease outbreaks from search logs is challenging due to short-term and long-term instability.
method Seasonal-adjustment method decomposes logs into seasonal, trend, and irregular components; feature selection method selects relevant search terms.
result Proposed method outperforms comparative methods in prediction accuracy for seven of ten diseases.

Study robustness of early-stopping GD for linear regression attacks.

problem Robustness of gradient-descent methods to adversarial attacks.
method Early-stopping strategies, gradient-descent, Mahalanobis attacks, feature-dependent learning rates, data transformations.
result Early-stopped GD is optimally robust to Euclidean-norm attacks but sub-optimal for Mahalanobis attacks.

SAM minimizes loss sharpness, improving adversarial transferability.

problem Improving adversarial transferability of deep neural networks.
method Evaluating surrogate models trained with seven minimizers, focusing on loss sharpness and flat neighborhoods.
result SAM minimizes loss sharpness, leading to better adversarial transferability.