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

61123184245 · Jun 202019922001200920172026
48 results for In-sensor inference

This paper introduces GLT for better input data representation in BNN and proposes a compact topology with block pruning.

problem Improving input data representation for Binary Neural Networks (BNN).
method Generic Learned Thermometer (GLT) for encoding, block pruning and Knowledge Distillation for compact topology.
result Significant accuracy gains and lightweight fully-binarized models with limited accuracy degradation.

Paper develops a scalable distributed inference algorithm for sensor networks.

problem Efficient inference in intelligent sensor networks for location, tracking, and mapping.
method Distributed variational inference algorithm for continuous variables and large-scale data.
result Derives a separable lower bound for distributed variational inference with one-hop communication.

Two novel distributed VB algorithms improve Bayesian inference in sensor networks.

problem Efficient inference in Bayesian frameworks for sensor networks.
method Two novel distributed VB algorithms for general Bayesian inference, using stochastic natural gradient and ADMM.
result Distributed algorithms perform nearly as well as centralized ones, demonstrating excellent performance.

Paper addresses state estimation in sensor networks with intermittent data.

problem State estimation in sensor networks with packet dropouts and corrupted observations.
method Bayesian variational inference with a dual-mask generative model.
result The method effectively identifies system states and noise parameters.

Optimizes resource allocation for distributed parameter estimation in sensor networks.

problem Maximizing accuracy in parameter estimation with limited resources.
method Formulates a data collection and collaboration policy design problem as a Fisher information maximization problem. Proposes multi-armed bandit algorithms for learning the optimal policy.
result Identifies optimal data collection and collaboration policies that balance resource use and estimation accuracy.

Improves parallel deep model performance by restructuring and pruning.

problem Latency in parallel deep model execution due to interdependency among sub-models.
method Layer-wise model restructuring and pruning, using 0\ell_0 optimization and Munkres assignment algorithm.
result Significantly improves efficiency of distributed inference in terms of communication and computational complexity.

'Sharing of statistical strength' is a phrase often employed in machine learning and signal processing. In sensor networks, for example, missing signals from certain sensors may be predicted by exploiting their correlation with observed signals acquired from other sensors. For humans, our hands move synchronously with …

2018-03-13abs ↗pdf ↗

Paper improves generalization bounds for multi-kernel learning with mixed datasets.

problem Improving generalization for multi-kernel learning with mixed Markov chain datasets.
method Developed novel generalization bounds with O(logm)O(\sqrt{\log m}) and O(1/n)O(1/\sqrt{n}) dependencies.
result Added terms compensate for dependency among samples in mixed datasets.

The facility location problem is widely used for summarizing large datasets and has additional applications in sensor placement, image retrieval, and clustering. One difficulty of this problem is that submodular optimization algorithms require the calculation of pairwise benefits for all items in the dataset. This is i…

2017-03-08abs ↗pdf ↗

PSMM method optimizes matrix sufficient dimension reduction.

problem Feature matrices with row- and column-wise interpretations require efficient dimension reduction.
method PSMM method converts matrix problem into classification problems using rank-1 normal matrix.
result PSMM outperforms existing methods and provides strong interpretability.

Paper reviews multi-way graph signal processing for tensor data.

problem Maximizing use of multi-way structure in irregular tensor data.
method Generalizes GSP to multi-way data, focusing on graph signals across tensor modes.
result Synthesizes common themes in combining GSP with tensor analysis.

Advances in sensor technology have enabled the collection of large-scale datasets. Such datasets can be extremely noisy and often contain a significant amount of outliers that result from sensor malfunction or human operation faults. In order to utilize such data for real-world applications, it is critical to detect ou…

2018-08-26abs ↗pdf ↗

Paper proposes Coalitional BAE to improve explainability of unsupervised deep learning models.

problem Improving explainability of Autoencoder's predictions.
method Introduces Coalitional BAE, inspired by agent-based system theory, to reduce correlation in explanations.
result Improved quality of explanations using Coalitional BAE on publicly available datasets.

Study on collaboration vs. independent data collection in sensor networks.

problem Impact of sensor correlation on data collection strategies.
method Analysis of Fisher information and Cramer-Rao bound.
result Optimal strategy involves transferring non-immediate information for improved estimation.

Machine learning models estimate nutrient concentrations from water quality surrogates.

problem Estimating high frequency nutrient concentrations from limited in-situ measurements.
method Used machine learning (Random Forests) to estimate nutrient concentrations using surrogate measures.
result Reduced RMSE by up to 60.1% compared to linear models, with additional sensors not providing significant benefits.

The study recovers airflow from thoracic and abdominal movements using advanced signal processing.

problem Challenges in measuring airflow from thoracic and abdominal movements using small, inexpensive devices.
method Synchrosqueezing transform and locally stationary Gaussian process regression.
result Accurate prediction of airflow achieved in both normal sleep and anesthesia transition cases.

Kriformer uses graph transformers to estimate data in sparse sensor areas.

problem Sparse sensor deployment and unreliable data in spatiotemporal kriging tasks.
method Graph transformer model with positional encoding and attention mechanisms.
result Kriformer excels in representing unobserved locations in spatiotemporal kriging tasks.

Paper tackles concept drift in Federated Learning, improving model performance.

problem Concept drift in real-world data makes existing Federated Learning methods ineffective.
method Introduces a multiscale algorithm combining extit{FedAvg} and extit{FedOMD} with non-stationary detection and adaptation.
result Achieves dynamic regret of $\Tilde{\mathcal{O}} ( \min \{ \sqrt{LT} , Δ^{\frac{1}{3}}T^{\frac{2}{3}} + \sqrt{T} \})$ for TT rounds.

A new ICA model identifies shared brain activity patterns across subjects.

problem Challenges in modeling shared responses in neuroimaging studies with large cohorts.
method MultiView Independent Component Analysis (ICA) model with closed-form likelihood and alternate quasi-Newton method.
result Improved sensitivity in identifying common brain activity patterns.

One of the key challenges in sensor networks is the extraction of information by fusing data from a multitude of distinct, but possibly unreliable sensors. Recovering information from the maximum number of dependable sensors while specifying the unreliable ones is critical for robust sensing. This sensing task is formu…

2010-11-01abs ↗pdf ↗

Paper proposes a new tensor imputation method for spatiotemporal traffic data with missing patterns.

problem Imputation of corrupted or incomplete traffic data.
method Truncated tensor Schatten p-norm (TSpN) for spatiotemporal traffic data imputation.
result The proposed method outperforms other state-of-the-art tensor-based imputation models in various missing cases.

Inference models are a key component in scaling variational inference to deep latent variable models, most notably as encoder networks in variational auto-encoders (VAEs). By replacing conventional optimization-based inference with a learned model, inference is amortized over data examples and therefore more computatio…

2018-07-24abs ↗pdf ↗

This work frames active inference through control as inference, offering robust control algorithms.

problem Active inference framework lacks practical sensorimotor control algorithms.
method Frame active inference through control as inference, presenting trajectory optimization as inference.
result AI may be framed as partially-observed CaI when the cost function is defined in observation states.

PE-SVI reduces SVI inference complexity by finding a suitable start point.

problem Complex posterior inference in graphical models leads to suboptimal learning.
method PE-SVI uses a pseudo-encoded start point to reduce gradient steps and step sizes.
result PE-SVI achieves the same ELBo objective as SVI with less than 1% of the required steps.

SNVI combines likelihood estimation with variational inference for efficient Bayesian inference.

problem Bayesian inference in models with intractable likelihoods.
method Sequential Neural Variational Inference (SNVI) that combines likelihood-estimation with variational inference.
result SNVI is more computationally efficient than previous algorithms without sacrificing accuracy.

Paper introduces a diagnostic for approximate inference methods.

problem Estimating errors in probabilistic inference algorithms, especially for approximate methods.
method Repeatedly simulate datasets from the prior and perform inference on each, estimating a symmetric KL-divergence.
result A diagnostic for approximate inference methods can be estimated using symmetric KL-divergence.

Probabilistic inference procedures are usually coded painstakingly from scratch, for each target model and each inference algorithm. We reduce this effort by generating inference procedures from models automatically. We make this code generation modular by decomposing inference algorithms into reusable program-to-progr…

2016-03-06abs ↗pdf ↗