Kernel-based RL learns efficient spectrum access with budget constraints.
problem Efficient spectrum access in congested bands.
method Kernel-based reinforcement learning with budget-constrained sparsification.
result Performance gains over carrier-sense systems.
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.
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 O(logT) regret with a smaller coefficient than traditional UCB. 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…
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.
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.
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.
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.
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.
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.
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.
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.
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…
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 δ>0 which identify the distinct δ covers of the space. We investigat…
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.
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.
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.
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.
Constructs manifolds with specific spectral properties.
problem Spectral properties of Riemannian manifolds.
method Asymptotically hyperbolic manifolds with sharp curvature bounds.
result Embeds singular continuous spectrum into the essential spectrum of the Laplacian.
The spectrum of certain manifolds matches that of hyperbolic space if the bottom spectrum is maximal.
problem Investigating spectral rigidity of manifolds with Ricci bounded below and maximal bottom spectrum.
method Analyzing the spectrum of the Laplacian on manifolds with specific Ricci curvature bounds.
result The spectrum of the manifold coincides with that of hyperbolic space if the bottom spectrum is maximal.
Lower bounds for Hodge-Laplacian spectrum on orbifolds.
problem Finding bounds for the essential spectrum of Hodge-Laplacian.
method Deriving lower bounds for the essential spectrum of the Hodge-Laplacian on geometrically finite orbifolds and their suborbifolds.
result Lower bounds for the essential spectrum of the Hodge-Laplacian.
Rigidity of spectral data for spherical manifolds with boundary.
problem Determining the length spectrum of spherically symmetric manifolds with boundary.
method Proving a trace formula and using it to show spectral rigidity.
result The Neumann spectrum uniquely determines the length spectrum for spherically symmetric manifolds with boundary.
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.
Trapezoids uniquely identified by their Dirichlet Laplace spectrum.
problem Identifying trapezoids based on their spectral properties.
method Analyzing the Dirichlet Laplace spectrum of non-obtuse trapezoids.
result Non-obtuse trapezoids are uniquely determined by their Dirichlet Laplace spectrum.
In 2004, Sormani and Wei introduced the covering spectrum: a geometric invariant that isolates part of the length spectrum of a Riemannian manifold. In their paper they observed that certain Sunada isospectral manifolds share the same covering spectrum, thus raising the question of whether the covering spectrum is a sp…
Survey on bottom of spectrum of Hodge Laplacian on complete noncompact Kähler manifolds
problem Bottom of the spectrum of Hodge Laplacian on complete noncompact Kähler manifolds
method Survey on Kähler hyperbolic manifolds and bounded symmetric domains
result Proposed several open problems
The paper extends decay estimates to graphs with positive spectrum.
problem Proving decay estimates for nonnegative functions on graphs.
method Sharp ℓ2 decay estimates for nonnegative generalized subharmonic functions. result Extends Li and Wang's result to graphs with positive Laplacian spectrum.
Upper bounds for essential spectrum of minimal submanifolds linked to volume growth.
problem Estimating the essential spectrum of minimal submanifolds.
method Using volume growth to bound the bottom of the essential spectrum.
result Improved essential spectrum estimate for minimal submanifolds.
Upper bounds for volume spectrum depend on volume, dimension, and a conformal invariant.
problem Bounding the volume spectrum of Riemannian manifolds.
method Proves upper bounds that depend on volume, dimension, and a conformal invariant.
result Upper bounds for the volume spectrum are established.
Study on magnetic Dirac operators and their spectrum.
problem Understanding the spectrum of magnetic Dirac operators.
method Analysis of magnetic Dirac operators over complete Riemannian manifolds.
result Find sufficient conditions for maximal or discrete spectrum.
Covering preserves bottom spectrum, implies amenable covering.
problem Spectral preservation in Riemannian coverings.
method Proving spectral properties of Schrödinger operators on coverings.
result Covering preserving bottom spectrum implies amenability.
Notes on continuity of discrete-spectrum Fredholm operators.
problem Continuity properties of discrete-spectrum families of Fredholm operators.
method Relates recent work on discrete-spectrum families to classical continuity properties.
result Establishes connections between new and classical concepts.
Study shows ortho spectrum doesn't fully determine systolic length but limits the number of possible structures.
problem Determining the systolic length of hyperbolic surfaces with boundary.
method Analyzing the ortho spectrum of hyperbolic surfaces with totally geodesic boundary.
result There are only finitely many possibilities for the ortho spectrum and corresponding hyperbolic structures.
The rigidity of marked length spectrum for closed hyperbolic surfaces due to Fricke-Klein [7] has been the motivation of many different rigidity results, specially for manifolds of negative curvature. From the works of Vigneras [18], Sunada [17] and many other authors this result is far from being true for the unmarked…
ManifoldFlow relaxes fixed-spectrum Stiefel layers to learn a positive spectrum.
problem Fixed-spectrum Stiefel layers impose rigid spectral constraints.
method Introduces ManifoldFlow, a relaxation that learns a positive spectrum while keeping the basis on the Stiefel manifold.
result Learnable SPD spectrum improves performance in various settings.
Study essential spectrum of differential operators on geometrically finite orbifolds.
problem Analyzing the essential spectrum of differential operators over specific geometric structures.
method Investigates first order and Laplace type elliptic differential operators on Riemannian vector bundles over geometrically finite orbifolds.
result Discovers properties of essential spectra for these operators.
Study on length spectrum of random hyperbolic 3-manifolds.
problem Understanding the length spectrum of random hyperbolic 3-manifolds.
method Modeling random hyperbolic 3-manifolds using truncated tetrahedra and analyzing their length spectrum as volume tends to infinity.
result The length spectrum converges in distribution to a Poisson point process with a computable intensity λ as volume increases.