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

5.0%10.0%15.0%20.0% · Aug 199419922001200920182026
48 results for WiFi logs

Deep learning model classifies concurrent human interactions from WiFi data with high accuracy.

problem Classifying concurrent human interactions from WiFi data with high accuracy.
method Attention-BiGRU deep learning model using Multiple Input Multiple Output radio link.
result Maximum benchmark accuracy of 94% for a single subject-pair, 88% for ten subject pairs.

CMDRNN predicts user location using WiFi fingerprints with deep learning.

problem Predicting user activity with WiFi fingerprints is challenging due to high dimensionality.
method Combines CNN, RNN, and MDN to model high-dimensional time-series data.
result CMDRNN effectively predicts user location using WiFi fingerprints.

Neural networks predict airport passenger behavior using WiFi traces.

problem Predicting airport passenger activity choices inside the terminal.
method Three neural network architectures: FNN, LSTM, and their combination. Inputs include static and dynamic passenger data. Real-world case study at Bologna Airport.
result LSTM approach, especially with short prediction horizons, outperforms FNN.

Two deep learning models improve indoor location prediction from WiFi fingerprints.

problem Indoor location prediction from WiFi fingerprints.
method Convolutional mixture density recurrent neural network and VAE-based semi-supervised learning model.
result Proposed models outperform existing methods in real-world datasets.

We consider semi-supervised regression when the predictor variables are drawn from an unknown manifold. A simple two step approach to this problem is to: (i) estimate the manifold geodesic distance between any pair of points using both the labeled and unlabeled instances; and (ii) apply a k nearest neighbor regressor b…

2016-11-07abs ↗pdf ↗

We utilize Wi-Fi communications from smartphones to predict their mobility mode, i.e. walking, biking and driving. Wi-Fi sensors were deployed at four strategic locations in a closed loop on streets in downtown Toronto. Deep neural network (Multilayer Perceptron) along with three decision tree based classifiers (Decisi…

2018-09-16abs ↗pdf ↗

Complex-valued neural networks improve wireless fingerprinting robustness.

problem Distinguish between devices sending the same message, robust against spoofing.
method Used complex-valued neural networks for supervised learning of fingerprints from wireless signals.
result Noise augmentation by adding white Gaussian noise leads to significant performance gains.

Deep learning models can learn confounding factors instead of device fingerprints in wireless signals.

problem Learning device fingerprints from complex-valued deep neural networks in the presence of confounding factors.
method Investigating complex-valued deep neural networks (DNNs) to distinguish between wireless transmitters, focusing on clock drift and channel variations.
result DNNs learn confounding features rather than device-specific characteristics, requiring strategies to promote generalization.

Study neural communication systems with bandwidth-limited channels.

problem Reliable message transmission despite noisy channels.
method Jointly model compression and error correction with neural networks; introduce prior for missing information; use auxiliary latent variables.
result Joint neural communication systems outperform separate models under expected information loss.

Paper proves integrability and entropy compactness for Kähler potentials with uniform log-log threshold.

problem Integrability and entropy compactness for Kähler potentials with specific density.
method Skoda-Zeriahi type integrability theorem and log-log threshold detection.
result Positivity of integrability threshold and entropy compactness for uniform log-log threshold.

In this paper, we prove that the zero-locus of any global holomorphic log-one-form on a projective log-smooth pair (X,D)\left(X,D\right) of log-general type must be non-empty. Applying this result, we give an answer to the algebraic hyperbolicity part of Shafarevich's conjecture, with the generic fiber being Kawamata-log-…

2017-11-15abs ↗pdf ↗

A novel GPUM constructs Gaussian Processes for unknown manifolds with probabilistic metrics.

problem High-dimensional data on unknown manifolds with non-Euclidean geometry.
method Bayesian Gaussian Processes latent variable models (BGPLVM), Riemannian geometry, probabilistic metric tensor, Brownian Motion.
result GPUM provides more accurate predictions on unknown manifolds compared to traditional methods.

We consider active learning with logged data, where labeled examples are drawn conditioned on a predetermined logging policy, and the goal is to learn a classifier on the entire population, not just conditioned on the logging policy. Prior work addresses this problem either when only logged data is available, or purely…

2018-02-25abs ↗pdf ↗

Establishes log-concavity estimates for convex domains' first Dirichlet eigenfunctions.

problem Quantifying the Hessian of log-concave eigenfunctions on convex domains.
method Analyzes log-concavity properties of the first Dirichlet eigenfunction on convex domains.
result Obtains quantitative estimates for the Hessian of logu\log u.

Study improves sampling from non-log-concave distributions using Fisher information.

problem Sampling from non-log-concave distributions with high Fisher information guarantees.
method Proximal sampler with RGO implementation, leveraging log-concave sampling results.
result Improved complexity guarantee in relative Fisher information for non-log-concave sampling.

Study confirms boundedness of certain singularities in log Fano geometry.

problem Boundedness of log Fano cone singularities and minimal log discrepancies.
method Analyzing local volumes and minimal log discrepancies of Kollár components.
result Boundedness of K-semistable log Fano cone singularities confirmed in dimension three.

New algorithms improve convergence rates for non-log-concave sampling and log-partition estimation.

problem Efficiently sampling from non-log-concave distributions and estimating their log-partition function.
method Analysis of information-based complexity, study of polynomial-time sampling algorithms.
result Optimal rates for sampling and log-partition estimation sometimes exceed those for optimization.

AppsPred predicts smartphone app usage based on context.

problem Predicting personalized usage behavior of smartphone apps based on contexts.
method Random Forest machine learning technique considering multi-dimensional contexts.
result AppsPred significantly outperforms other machine learning approaches in predicting smartphone apps.

Defines log Floer cohomology for symplectic surfaces with a degenerate part.

problem Extending Floer cohomology to degenerate symplectic structures.
method Definition of log Floer cohomology for oriented log symplectic surfaces.
result Log Floer cohomology is invariant under isotopies and isomorphic to log de Rham cohomology for a single Lagrangian.

Using stable log maps, we introduce log twisted differentials extending the notion of abelian differentials to the Deligne-Mumford boundary of stable curves. The moduli stack of log twisted differentials provides a compactification of the strata of abelian differentials. The open strata can have up to three connected c…

2016-10-17abs ↗pdf ↗

Constructs Kahler-Einstein metrics near isolated log canonical singularities.

problem Constructing metrics near singularities in complex geometry.
method Constructs Kahler-Einstein metrics with negative scalar curvature near isolated log canonical singularities.
result Metrics are complete near the singularity if the underlying space has complex dimension 2 or if the singularity is smoothable.

We study topological properties of log-symplectic structures and produce examples of compact manifolds with such structures. Notably we show that several symplectic manifolds do not admit log-symplectic structures and several log-symplectic manifolds do not admit symplectic structures, for example #m CP^2 # n bar(CP^2)…

2013-03-26abs ↗pdf ↗

We consider the problem of learning a general graph G=(V,E)G=(V,E) using edge-detecting queries, where the number of vertices V=n|V|=n is given to the learner. The information theoretic lower bound gives mlognm\log n for the number of queries, where m=Em=|E| is the number of edges. In case the number of edges mm is also given t…

2018-03-28abs ↗pdf ↗