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

55109164218 · Jun 202019922001200920172026
48 results for Active Sensing

Paper proposes an active learning method to improve remote sensing object detection with less labeled data.

problem High labor and time costs in annotating remote sensing images for CNN object detectors.
method Uncertainty-based active learning that selects images with more information for annotation.
result Detector achieves high performance with a fraction of the training images.

Study uses remotely sensed data to infer economic outcomes in experiments and quasi-experiments.

problem Imperfect measurement of economic outcomes by remotely sensed variables.
method Combines experimental and observational data to identify causal parameters, using satellite imagery and mobile phone activity.
result Developed a robust method for n^{-1/2} inference that does not restrict remotely sensed variable processing algorithms.

Understanding how spatial configurations of economic activity emerge is important when formulating spatial planning and economic policy. A simple model was proposed by Simon, who assumed that firms grow at a rate proportional to their size, and that new divisions of firms with certain probabilities relocate to other fi…

2012-04-30abs ↗pdf ↗

Autonomous systems can be used to search for sparse signals in a large space; e.g., aerial robots can be deployed to localize threats, detect gas leaks, or respond to distress calls. Intuitively, search algorithms may increase efficiency by collecting aggregate measurements summarizing large contiguous regions. However…

2016-12-02abs ↗pdf ↗

This paper develops an active sensing method to estimate the relative weight (or trust) agents place on their neighbors' information in a social network. The model used for the regression is based on the steady state equation in the linear DeGroot model under the influence of stubborn agents, i.e., agents whose opinion…

2016-01-21abs ↗pdf ↗

Deciding what and when to observe is critical when making observations is costly. In a medical setting where observations can be made sequentially, making these observations (or not) should be an active choice. We refer to this as the active sensing problem. In this paper, we propose a novel deep learning framework, wh…

2019-06-16abs ↗pdf ↗

This paper proposes a geometry-aware active learning framework for spatiotemporal dynamic systems.

problem Challenges in modeling complex dynamic systems with 3D geometries and time evolution.
method Geometry-aware spatiotemporal Gaussian Process (G-ST-GP) and adaptive active learning strategy.
result The proposed framework outperforms traditional methods in predicting high-dimensional dynamic behaviors.

We consider the problems of detection and localization of a contiguous block of weak activation in a large matrix, from a small number of noisy, possibly adaptive, compressive (linear) measurements. This is closely related to the problem of compressed sensing, where the task is to estimate a sparse vector using a small…

2012-09-15abs ↗pdf ↗

Sharp asymptotics reveal how network width controls learnability in quadratic neural networks.

problem Understanding learnability in overparameterized quadratic neural networks.
method Mapping ERM to convex matrix sensing with nuclear norm penalization.
result Characterization of global minima and precise generalization thresholds.

Active deep learning classification of hyperspectral images is considered in this paper. Deep learning has achieved success in many applications, but good-quality labeled samples are needed to construct a deep learning network. It is expensive getting good labeled samples in hyperspectral images for remote sensing appl…

2016-11-30abs ↗pdf ↗

Polynomial neural networks explore thresholds for maximum expressiveness.

problem Understanding the limits of polynomial neural networks' expressiveness.
method Introducing activation degree threshold to measure network expressiveness and proving its existence and upper bounds.
result Polynomial neural networks with equi-width architectures achieve the maximum expressiveness.

Residual networks with block width max(d_x, d_y) approximate all functions.

problem Achieving universal approximation with residual networks.
method Established bounds on block width for different activation functions.
result Minimum block width for universal approximation is max(d_x, d_y) with inner width 1.

DiffATD efficiently discovers targets in partially observable environments using diffusion dynamics.

problem Efficiently discovering targets in partially observable environments with limited sampling.
method DiffATD uses diffusion dynamics to maintain a belief distribution over unobserved states, balancing exploration and exploitation.
result DiffATD outperforms baselines and supervised methods in diverse domains.

Deep neural networks are often used to implement powerful generative models for real-world data. Notable applications include image denoising, as well as other classical inverse problems like compressed sensing and super-resolution. To provide a rigorous but simplified analysis of generative models, in this work, we in…

2018-03-25abs ↗pdf ↗

We consider active, semi-supervised learning in an offline transductive setting. We show that a previously proposed error bound for active learning on undirected weighted graphs can be generalized by replacing graph cut with an arbitrary symmetric submodular function. Arbitrary non-symmetric submodular functions can be…

2012-02-14abs ↗pdf ↗

Normalization techniques play an important role in supporting efficient and often more effective training of deep neural networks. While conventional methods explicitly normalize the activations, we suggest to add a loss term instead. This new loss term encourages the variance of the activations to be stable and not va…

2018-11-21abs ↗pdf ↗

We consider the problem of learning the functions computing children from parents in a Structural Causal Model once the underlying causal graph has been identified. This is in some sense the second step after causal discovery. Taking a probabilistic approach to estimating these functions, we derive a natural myopic act…

2017-06-30abs ↗pdf ↗

We study active learning where the labeler can not only return incorrect labels but also abstain from labeling. We consider different noise and abstention conditions of the labeler. We propose an algorithm which utilizes abstention responses, and analyze its statistical consistency and query complexity under fairly nat…

2016-10-30abs ↗pdf ↗

New method disentangles perceptual uncertainty and behavioral costs in partially observable systems.

problem Tackles inverse optimal control for non-linear partially observable systems.
method Probabilistic approach using maximum causal entropy formulations and local linearization.
result Disentangles perceptual factors and behavioral costs in sequential decision-making.

Residential homes constitute roughly one-fourth of the total energy usage worldwide. Providing appliance-level energy breakdown has been shown to induce positive behavioral changes that can reduce energy consumption by 15%. Existing approaches for energy breakdown either require hardware installation in every target ho…

2019-09-02abs ↗pdf ↗

For any strictly positive martingale S=exp(X)S = \exp(X) for which XX has a characteristic function, we provide an expansion for the implied volatility. This expansion is explicit in the sense that it involves no integrals, but only polynomials in the log strike. We illustrate the versatility of our expansion by computing t…

2012-07-01abs ↗pdf ↗

In financial asset management, choosing a portfolio requires balancing returns, risk, exposure, liquidity, volatility and other factors. These concerns are difficult to compare explicitly, with many asset managers using an intuitive or implicit sense of their interaction. We propose a mechanism for learning someone's s…

2017-08-24abs ↗pdf ↗

Study improves distributed linear estimation under adversarial conditions.

problem Mean estimation of a random vector with adversarial measurements and asynchrony.
method Two-timescale ℓ1-minimization algorithm with tight convergence rates.
result Unified finite-time characterization of robustness, identifiability, and statistical efficiency.

Derives equations for deep learning biases and weights, showing data complexity reduction.

problem Understanding interpretability in supervised learning.
method Gradient flow equations and dynamical truncation of training data.
result Data complexity reduction at an exponential rate with training.

There is a widely-accepted need to revise current forms of health-care provision, with particular interest in sensing systems in the home. Given a multiple-modality sensor platform with heterogeneous network connectivity, as is under development in the Sensor Platform for HEalthcare in Residential Environment (SPHERE) …

2017-02-04abs ↗pdf ↗