Opportunistic spectrum access is one of the emerging techniques for maximizing throughput in congested bands and is enabled by predicting idle slots in spectrum. We propose a kernel-based reinforcement learning approach coupled with a novel budget-constrained sparsification technique that efficiently captures the envir…
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,181 papers · 148 categories
Trend · papers per month
48 results for “Opportunistic Spectrum Access”
Proposes a multi-stage algorithm for efficient spectrum access in CR networks.
problem High demand for wireless spectrum and need for high throughput and energy efficiency in SUs.
method Centralized multi-stage algorithm with non-parametric learning and adaptive collision avoidance.
result Ensures minimum interference to licensed users while providing high throughput and energy efficiency.
The paper explores cost-aware spectrum access strategies in cognitive radio systems.
problem Optimizing spectrum usage in cognitive radio systems with uncertain channel states and costs.
method Discrete time model with sensing and transmission phases, considering random costs and rewards.
result The optimal policy for spectrum access has a recursive double threshold structure, and online algorithms achieve near-optimal performance.
We consider the task of opportunistic channel access in a primary system composed of independent Gilbert-Elliot channels where the secondary (or opportunistic) user does not dispose of a priori information regarding the statistical characteristics of the system. It is shown that this problem may be cast into the framew…
In this paper, we address the general case of a coordinated secondary network willing to exploit communication opportunities left vacant by a licensed primary network. Since secondary users (SU) usually have no prior knowledge on the environment, they need to learn the availability of each channel through sensing techn…
This paper examines unfair trading practices in NFT markets.
problem Sophisticated actors exploit market inefficiencies for unfair profits.
method Analyzes three types of opportunistic trading strategies.
result Identifies and categorizes unfair trading practices in NFT markets.
A machine learning approach for efficient spectrum sharing in distributed DSA networks.
problem Effective spectrum sharing among secondary users (SUs) and primary users (PUs) in a distributed network.
method Deep reinforcement learning (DRL) combined with reservoir computing (RC) for distributed spectrum access decisions.
result The RC-based spectrum access strategy significantly reduces collision chances and outperforms other methods.
New policy reduces spectrum access regret in uncoordinated systems.
problem Uncoordinated spectrum access with user-dependent rewards.
method Multi-user multi-armed bandit (MAB) model with user-specific rewards.
result Achieves regret for spectrum access.
Algorithm optimizes spectrum access for dynamic multi-user environments.
problem Optimizing spectrum access in uncoordinated multi-user environments with potential collisions.
method Stochastic multi-user bandit framework with estimation and allocation phases.
result Order-optimal system-wide regret of for dynamic and static cases.
AdaLinUCB optimizes exploration-exploitation for contextually varying costs.
problem Optimizing decision-making in environments with varying exploration costs.
method Adaptive Upper-Confidence-Bound (AdaLinUCB) algorithm for opportunistic learning.
result AdaLinUCB achieves O((log T)^2) regret bound, significantly outperforming other algorithms.
New algorithm balances exploration and exploitation in opportunistic bandits.
problem Regret of pulling suboptimal arms varies with environmental conditions.
method Proposes AdaUCB algorithm to adaptively balance exploration and exploitation.
result AdaUCB achieves regret with a smaller coefficient than traditional UCB.
This paper uses bandit algorithms to reduce the cost of user interface experimentation in online retail.
problem Reducing the cost of user interface experimentation in online retail.
method Modeling user interface experimentation as an opportunistic bandit problem, reducing the cost of exploration.
result Significant regret reduction and improved contextual information for testing.
New algorithms for uncoordinated spectrum access with multi-user multi-armed bandits.
problem Uncoordinated spectrum access with unknown number of users and channels.
method Developed algorithms for stochastic and adversarial settings, combining Exp3.P for dynamic scenarios.
result Sub-linear regret guarantees for both stochastic and adversarial cases, even when users outnumber channels.
We present a new random sampling strategy for k-bandlimited signals defined on graphs, based on determinantal point processes (DPP). For small graphs, ie, in cases where the spectrum of the graph is accessible, we exhibit a DPP sampling scheme that enables perfect recovery of bandlimited signals. For large graphs, ie, …
A Deep Learning Mechanism for Efficient Information Dissemination in Vehicular Floating Contentstat.ML
Deep learning optimizes vehicular communication zones for efficient data dissemination.
problem Overdimensioning and inefficient communication in vehicular floating content.
method Deep learning is used to select optimal broadcasting areas (Anchor Zones) for efficient message dissemination.
result The proposed method achieves an accuracy of 89.7% in predicting optimal Anchor Zones, saving up to 27% of resources.
Elephants or Goldfish? An Empirical Analysis of Carrier Reciprocity in Dynamic Freight Marketsq-fin.GN
Empirical study shows carriers ignore past shippers' behavior, focusing only on current actions.
problem Opportunistic behavior by shippers and carriers in dynamic freight markets.
method Empirical analysis of carrier reciprocity in US truckload transportation sector.
result Carriers do not remember shippers' past behaviors but respond to current actions.
The effect of data encoding on the expressive power of variational quantum machine learning modelsquant-ph
Quantum models can approximate any function if data encoding allows for a rich enough frequency spectrum.
problem Theoretical properties of quantum machine learning models, particularly their expressive power.
method Investigated how data encoding affects the expressive power of parametrized quantum circuits.
result Quantum models can access increasingly rich frequency spectra by repeating data encoding gates, potentially making them universal function approximators.
Neural Network Cognitive Engine for Autonomous and Distributed Underlay Dynamic Spectrum Accesscs.NI
Paper presents a neural network for managing interference in DSA.
problem Managing interference between primary and secondary networks in DSA.
method Artificial neural network predicts CR's effect on PN without direct communication.
result Fine-tuned transmit power control and higher transmission opportunities for CRs.
Develops methods for dynamic pricing in incomplete data settings.
problem Incomplete historical data makes optimal pricing difficult.
method Nonparametric partial identification framework for offline dynamic pricing.
result Pessimistic and opportunistic policies with regret bounds.
Deep RL for uncoordinated cognitive radios finds near-optimal policies.
problem Resource allocation in uncoordinated cognitive radio networks.
method Distributed deep reinforcement learning algorithm.
result Algorithm converges to near-optimal policies in finite time.
A Learning-Based Two-Stage Spectrum Sharing Strategy with Multiple Primary Transmit Power Levelseess.SP
A strategy for spectrum sharing in CRNs with multiple PT power levels.
problem Efficient spectrum usage for secondary users in CRNs with multiple PT power levels.
method Data-driven/machine learning based multi-level spectrum sensing and prediction-transmission structures.
result The proposed strategy effectively aligns the ST with the PT power levels, improving spectrum usage.
This paper improves fairness in recommendation systems by learning individual preferences across multiple dimensions.
problem Fairness in recommender systems, especially in areas with social impact.
method Opportunistic multi-aspect re-ranking approach that learns individual preferences and enhances provider fairness.
result Achieves a better trade-off between accuracy and fairness across multiple fairness dimensions.
New method estimates large matrices' spectra from small sub-matrices.
problem Estimating large matrices' spectra when full matrix-vector products are not available.
method Free decompression based on free probability theory.
result Estimates eigenspectrum of impalpable matrices from small sub-matrices.
We propose a design for schedule-based execution trading strategies based on uncertainty bands. This formulation: 1) simplifies strategy specification and implementation; 2) provides for flexible allocation among passive, opportunistic, aggressive, and dark pool crossing execution tactics; 3) allows for rapid enhanceme…
A new approach uses deep learning to manage vehicular content efficiently.
problem Managing content replication and caching in vehicular networks efficiently.
method Data-driven, centralized approach using a Convolutional Neural Network (CNN).
result Effective strategies derived to modulate FC operation in space and adapt to mobility changes.
RL-Exec uses reinforcement learning to optimize BTC-USD liquidation, outperforming traditional methods.
problem Optimizing liquidation strategies on BTC-USD limit-order books with transient impact and latency.
method PPO agent trained on historical BTC-USD limit-order book replays, incorporating impact resilience and fees.
result RL-Exec significantly outperforms TWAP and a VWAP-like baseline on BTC-USD liquidation, with performance improving with longer execution horizons.
OverQ increases model accuracy by handling outliers in neural networks with minimal hardware changes.
problem Handling outliers in neural network weights and activations for low-precision quantization.
method Overwrite quantization (OverQ) that opportunistically increases bitwidth for activation outliers.
result OverQ can handle over 90% of outliers and achieve +5% ImageNet Top-1 accuracy on a quantized ResNet-50 at 4 bits.
Muon outperforms GD in associative memory learning by balancing frequency components.
problem Training dynamics and scaling behavior of Muon in associative memory learning.
method Study of Muon in a linear associative memory model with softmax retrieval and hierarchical frequency spectrum over query-answer pairs.
result Muon achieves exponential speedup over GD in noiseless case and superior scaling efficiency in noisy case.
Deep learning improves weak lensing cosmological constraints.
problem Extracting non-Gaussian information from weak lensing data.
method 2D convolutional neural network trained on simulated lensing maps.
result Neural network yields 5x tighter constraints than power spectrum.
Study of large batch size training using Hessian analysis and robust optimization.
problem Accuracy loss in large batch size training and robustness to adversarial perturbation.
method Hessian-based analysis and robust optimization to study large batch size training.
result Large batch size training converges to points with higher Hessian spectrum, indicating better robustness.
In these survey lectures, we investigate the geometric and analytic properties of transverse Dirac operators. In particular, we define a transverse Dirac operator associated to a distribution that is essentially self-adjoint (Prokhorenkov-R result). We describe the Habib-R Theorem showing that the invariance of the spe…
AnyThreat detects insider threats with minimal false positives.
problem High false positives in detecting insider threats.
method Opportunistic knowledge discovery system with four components: feature engineering, oversampling, class decomposition, and classification.
result Detects 87.5% of malicious insider threats with minimal false positives.
Method finds compatible features for subsets of data.
problem Selecting relevant features for subsets of data.
method Reframe feature selection as finding sections of quiver representations, using quiver Laplacians.
result Eigenvectors of quiver Laplacian yield compatible features.
Study uses random forest to detect unlawful insider trading in financial data.
problem Detecting and identifying unlawful insider trading in complex financial data.
method Integrates PCA-RF and standalone RF models with semi-manually labeled transactions.
result 96.43% accurate classification of transactions, 95.47% lawful, 98.00% unlawful.
Traditional activity recognition systems work on the basis of training, taking a fixed set of sensors into account. In this article, we focus on the question how pattern recognition can leverage new information sources without any, or with minimal user input. Thus, we present an approach for opportunistic activity reco…
We consider the problem of approximating the set of eigenvalues of the covariance matrix of a multivariate distribution (equivalently, the problem of approximating the "population spectrum"), given access to samples drawn from the distribution. The eigenvalues of the covariance of a distribution contain basic informati…
The subject of this paper is the relationship among the marked length spectrum, the length spectrum, the Laplace spectrum on functions, and the Laplace spectrum on forms on Riemannian nilmanifolds. In particular, we show that for a large class of three-step nilmanifolds, if a pair of nilmanifolds in this class has the …
The subject of this paper is the relationship among the marked length spectrum, the length spectrum, the Laplace spectrum on functions, and the Laplace spectrum on forms on Riemannian nilmanifolds. In particular, we show that for a large class of three-step nilmanifolds, if a pair of nilmanifolds in this class has the …
We define a new spectrum for compact length spaces and Riemannian manifolds called the "covering spectrum" which roughly measures the size of the one dimensional holes in the space. More specifically, the covering spectrum is a set of real numbers which identify the distinct covers of the space. We investigat…
DIG visualizes complex time series data.
problem Insufficient visualization of high-dimensional dynamical processes.
method DIG (Dynamical Information Geometry) using diffusion framework.
result Reveals structure in multivariate time series data.
Study the energy spectrum of metrics on surfaces and its relation to simple length spectrum.
problem Relate the energy spectrum to the simple length spectrum of metrics on surfaces.
method Analyze the energy spectrum of metrics on surfaces and their Teichmüller spaces, considering homotopy conditions.
result The energy spectrum determines the simple length spectrum under certain conditions.
Paper proposes a new neural machine translation method for wave data.
problem Limited real-world sensor data for continuous signal waves.
method Introduces window-based representation and iterative back-translation for wave data.
result Significant performance improvements in wave translation tasks.
The paper compares two spectrum definitions and finds stability in one modification.
problem Generalizing eigenvalues to arbitrary functionals with stability.
method Comparison of Gromov's homotopy significant spectrum and Krasnoskii spectrum, with a modified definition of the homotopy significant spectrum.
result The modified homotopy significant spectrum is stable, and Cheeger constant corresponds to Krasnoskii eigenvalue.
We propose a flexible framework for spectral conversion (SC) that facilitates training with unaligned corpora. Many SC frameworks require parallel corpora, phonetic alignments, or explicit frame-wise correspondence for learning conversion functions or for synthesizing a target spectrum with the aid of alignments. Howev…
Proofs high-dimensional spectrum convergence of weighted sample covariance.
problem High-dimensional spectrum convergence of weighted sample covariance.
method Proposes a new, concise proof with stronger assumptions.
result Spectrum convergence proven for different weight distributions.
Study shows spectrum properties for specific Hadamard manifolds.
problem Spectrum properties of Hadamard manifolds.
method Absolute continuity and spectrum determination for two classes of Hadamard manifolds.
result Spectrum properties determined for specific Hadamard manifolds.
Iterative method 'Concent' corrects spectrum bias in covariance matrices.
problem Consistent bias in the spectrum of covariance matrices.
method 'Concent' iterative algorithm.
result Corrects spectrum bias for small and moderate dimensions.
Develops a new spectrum for annular links, recovering a transverse invariant at extreme gradings.
problem Understanding transverse link invariants in the annular setting.
method Constructs a stable homotopy type for annular links and defines a map to the Khovanov skein spectrum.
result At extreme gradings, the map from the Khovanov spectrum to the Khovanov skein spectrum recovers the cohomotopy transverse invariant.