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

6481,2971,9452,593 · Jun 202019922001200920172026
48 results for probability of jamming

Improved sample-efficient learning for non-coherent digital jamming.

problem Learning optimal jamming strategies in non-coherent digital modulation schemes without prior knowledge.
method Introduced a linear bandit algorithm that accounts for action similarities and integrates context features.
result Significantly improved convergence behavior compared to prior art.

An adversarial machine learning approach is introduced to launch jamming attacks on wireless communications and a defense strategy is presented. A cognitive transmitter uses a pre-trained classifier to predict the current channel status based on recent sensing results and decides whether to transmit or not, whereas a j…

2018-07-03abs ↗pdf ↗

We investigate the problem of reliable communication between two legitimate parties over deletion channels under an active eavesdropping (aka jamming) adversarial model. To this goal, we develop a theoretical framework based on probabilistic finite-state automata to define novel encoding and decoding schemes that ensur…

2018-04-09abs ↗pdf ↗

To accommodate heterogeneous tasks in Internet of Things (IoT), a new communication and computing paradigm termed mobile edge computing emerges that extends computing services from the cloud to edge, but at the same time exposes new challenges on security. The present paper studies online security-aware edge computing …

2018-05-09abs ↗pdf ↗

CLAMP uses neural manifold packing to improve self-supervised learning.

problem Improving self-supervised learning for vision tasks.
method CLAMP recasts representation learning as a manifold packing problem, introducing a loss function inspired by particle systems.
result CLAMP achieves competitive performance with state-of-the-art models and separates neural manifolds effectively.

This work proposes a new feature for transportation mode classification using GPS trajectories.

problem Classifying transportation modes from GPS trajectories to optimize urban mobility.
method The Ordinal Pattern Transition Graph and its self-transition probability are used for classification.
result The proposed feature outperforms existing methods in transportation mode classification.

Deep learning (DL), despite its enormous success in many computer vision and language processing applications, is exceedingly vulnerable to adversarial attacks. We consider the use of DL for radio signal (modulation) classification tasks, and present practical methods for the crafting of white-box and universal black-b…

2018-08-23abs ↗pdf ↗

Study uses neural networks to predict travel times for public transportation.

problem Inaccurate travel time predictions due to road traffic irregularities.
method Developed two neural network models (MLP and LSTM) using OD travel time matrix.
result Both models can make near-accurate predictions, but LSTM is more susceptible to noise.

TinyML models detect RF and cyber threats in spacecraft with low latency.

problem Detecting cyber-RF threats in autonomous spacecraft with low latency.
method Analysis of classical models (RF, LR, SVM, MLP) for latency-accuracy trade-offs.
result Logistic Regression achieves microsecond-level inference with minimal accuracy loss.

Paper introduces timing-based adversarial attacks on DRL-based navigation systems.

problem Vulnerability of DRL-based navigation systems to adversarial attacks.
method Timing-based adversarial strategies using physical noise patterns.
result Adversarial timing attacks significantly degrade DRL-based navigation performance.

Backdoor attacks on DRL-based traffic controllers cause stop-and-go waves or crashes.

problem Vulnerability of DRL-based traffic controllers to machine learning attacks.
method Developed a trigger design methodology based on traffic physics principles.
result Backdoored models can cause stop-and-go traffic waves or AV crashes when triggered.

Applications of safety, security, and rescue in robotics, such as multi-robot target tracking, involve the execution of information acquisition tasks by teams of mobile robots. However, in failure-prone or adversarial environments, robots get attacked, their communication channels get jammed, and their sensors may fail…

2018-03-26abs ↗pdf ↗

New concept of attitude towards probability introduced in risk sharing problems.

problem Risk sharing problems and attitudes towards probability.
method Generalized definition of probability premium, local approximation, rank-dependent utility model, dual theory.
result Attitude towards probability can be first-order or second-order, depending on the model.

Identifies conditions for multiple invariant probabilities in Markov kernels.

problem Global irreducibility and recurrence do not guarantee uniqueness of invariant probabilities.
method Uses Jordan decomposition of the difference of two invariant probabilities.
result A Markov kernel has more than one invariant probability if and only if it admits a visible absorbing decomposition.

This work improves deep neural network probability estimation methods.

problem Estimating probabilities from high-dimensional data with inherent uncertainty.
method Investigates and compares methods for probability estimation using deep neural networks, proposing a new method that promotes consistent probabilities.
result The new method outperforms existing approaches on most metrics on simulated and real-world data.

This work presents a new classifier that is specifically designed to be fully interpretable. This technique determines the probability of a class outcome, based directly on probability assignments measured from the training data. The accuracy of the predicted probability can be improved by measuring more probability es…

2017-10-27abs ↗pdf ↗

Investigates statistical properties of perturb-softmax and perturb-argmax distributions.

problem Underexplored statistical properties of Gumbel-Softmax and Gumbel-Argmax distributions.
method Investigates convexity and differentiability to determine completeness and minimality of these distributions.
result Identifies parameters that admit complete and minimal representation of probability distributions.

Maps sets to probability distributions to minimize information loss.

problem Learning to map sets to probability distributions to preserve information.
method Relates set operations to probability distribution interpolations and demonstrates a preliminary solution.
result Experimental results show the effectiveness of the set embedding approach.

Paper constructs unfaithful probability distributions in binary causal graphs.

problem Unfaithful probability distributions in binary causal graphs.
method Constructs unfaithful probability distributions in binary causal graphs.
result Examples of unfaithful probability distributions in binary causal graphs.

This paper analyzes the probability flow in the stock market using the Black-Scholes model.

problem The non-conservation of probability in the stock market.
method Expressed the Black-Scholes equation in Hamiltonian form and analyzed the flow of probability.
result Conditions under which probability might be conserved in the market, challenging the non-Hermitian nature of the Black-Scholes Hamiltonian.

The study examines Fisher-Riemann geodesics for nonparametric probability densities.

problem Understanding nonparametric probability densities using Fisher-Riemann geometry.
method Obtaining Fisher-Riemann geodesics as a limit of parametric cases with increasing parameters.
result The weak limit approach for nonparametric probability densities.