Dynamic cell-free networks reduce complexity in serving many devices with distributed APs and DRL.
problem Designing efficient cell-free networks with many devices and APs.
method Dynamic architecture, SIC, DAS, DRL for optimization.
result DRL significantly improves performance in dynamic cell-free networks.
DeepSIC learns to detect multiple symbols in MIMO systems without assuming a specific channel model.
problem Challenges in multiuser MIMO detection due to non-linear channels and lack of accurate channel state information.
method Integrates machine learning into iterative soft interference cancellation (SIC) algorithm to learn from limited training samples.
result Significantly outperforms conventional methods in linear and non-linear channels, even with CSI uncertainty.
Accurate on-device keyword spotting (KWS) with low false accept and false reject rate is crucial to customer experience for far-field voice control of conversational agents. It is particularly challenging to maintain low false reject rate in real world conditions where there is (a) ambient noise from external sources s…
Paper presents a fast and adaptive filter for SI suppression in full-duplex transceivers.
problem Self-interference suppression in full-duplex transceivers with nonlinearity.
method Adaptive projected subgradient method (APSM) in a reproducing kernel Hilbert space (RKHS).
result The proposed method achieves favorable digital SIC performance compared to benchmarks.
Conventional multiuser detection techniques either require a large number of antennas at the receiver for a desired performance, or they are too complex for practical implementation. Moreover, many of these techniques, such as successive interference cancellation (SIC), suffer from errors in parameter estimation (user …
This letter extends the concept of graph-frequency to graph signals that evolve with time. Our goal is to generalize and, in fact, unify the familiar concepts from time- and graph-frequency analysis. To this end, we study a joint temporal and graph Fourier transform (JFT) and demonstrate its attractive properties. We b…
New algorithm optimizes interventions under network interference, scaling to large networks.
problem Optimal policy learning under network interference where one individual's treatment affects others.
method Developed a scalable Thompson sampling algorithm for dynamic networks.
result Proved a Bayesian regret bound that is sublinear in network size and rounds.
With increasing concerns about security, the need for highly secure physical biometrics-based authentication systems utilizing \emph{cancelable biometric} technologies is on the rise. Because the problem of cancelable template generation deals with the trade-off between template security and matching performance, many …
New learning-based methods improve spectral efficiency in mmWave full-duplex systems.
problem Residual self-interference and high pathloss in mmWave full-duplex systems.
method Proposed two learning schemes (ELM-HBF and CNN-HBF) using ADMM and MM algorithms for SI cancellation and joint HBF optimization.
result Learning-based schemes achieve at least 22.1% higher spectral efficiency and faster online prediction and training times.
Adaptive filters are applied in several electronic and communication devices like smartphones, advanced headphones, DSP chips, smart antenna, and teleconference systems. Also, they have application in many areas such as system identification, channel equalization, noise reduction, echo cancellation, interference cancel…
New measure of interference helps understand and mitigate learning issues in reinforcement learning.
problem Understanding and mitigating interference in reinforcement learning.
method Defined a new measure of interference, evaluated it, and identified key factors contributing to interference.
result Target network frequency and updates on the last layer are significant factors in interference.
New analysis shows entropy term cancels out in likelihood-based OOD detection.
problem Curious likelihood values for out-of-distribution data.
method Decomposed average likelihood into KL divergence and entropy terms.
result Entropy term explains OOD behaviour and cancels out in expectation.
New method removes interference bias in causal models.
problem Interference bias impedes causal effect identification in real-world settings.
method Novel definition of causal models with local interference, semi-parametric assumptions.
result True Average Causal Effect can be identified in certain semi-parametric models with local interference.
To survive in the dynamically-evolving world, we accumulate knowledge and improve our skills based on experience. In the process, gaining new knowledge does not disrupt our vigilance to external stimuli. In other words, our learning process is 'accumulative' and 'online' without interruption. However, despite the recen…
Study finds reinforcement learning performance plateaus due to environmental interference.
problem Catastrophic interference hinders sample efficiency in reinforcement learning.
method Empirical study in ALE, controlled experiments, analysis of prediction errors.
result Interference causes performance plateaus and degrades policies used to reach them.
Estimates causal effects in networks with varying interference.
problem Estimating causal effects in settings with network interference.
method Proposes neighborhood adaptive estimators for average direct treatment effect on the treated.
result Establishes rates of convergence and distributional results for proposed estimators.
TD learning reduces interference, leading to better generalization.
problem Understanding and reducing interference in TD learning for better generalization.
method Analyzing the inner product of gradients as interference, comparing TD and supervised learning, and examining the dynamics of interference and bootstrapping.
result TD learning leads to low-interference, under-generalizing parameters, while supervised learning does the opposite.
Deep learning (DL) based autoencoder has shown great potential to significantly enhance the physical layer performance. In this paper, we present a DL based autoencoder for interference channel. Based on a characterization of a k-user Gaussian interference channel, where the interferences are classified as different le…
Note on new cancellation formulas for manifolds.
problem Generalizing anomaly cancellation formulas to manifolds.
method Proving new (a, b) type cancellation formulas and using transgression.
result Obtained characteristic forms with modularity properties.
The paper addresses Qini curve estimation under clustered network interference.
problem Qini curves can be biased when interference is ignored in clustered network settings.
method Proposes three estimation strategies for clustered network interference.
result Identifies the most appropriate approach based on bias-variance trade-offs.
The order submission and cancelation processes are two crucial aspects in the price formation of stocks traded in order-driven markets. We investigate the dynamics of order cancelation by studying the statistical properties of inter-cancelation durations defined as the waiting times between consecutive order cancelatio…
Paper predicts interference for better LA in URLLC.
problem Improving LA for URLLC with strict latency and reliability.
method Exploits time correlation of interference for prediction.
result Predicted interference improves LA for URLLC.
This work addresses causal inference challenges in networked interference and proposes GNN-based estimators for individual treatment effects.
problem Estimating individual treatment effects in randomized experiments with networked interference.
method Uses Graph Neural Networks (GNNs) to capture network dependencies and derive causal effect estimators.
result Provides policy regret bounds and heuristic error bounds for GNN-based causal estimators under network interference and treatment capacity constraints.
DN estimator mitigates network interference in experiments.
problem Network interference biases naive experiment designs.
method Differences-in-Neighbors (DN) estimator designed to mitigate interference.
result DN achieves bias second order in interference effect, with exponentially smaller variance.
Study modular forms over Γ^0(2) and anomaly cancellation formulas.
problem Anomaly cancellation formulas for modular forms over Γ^0(2).
method Study and analysis of modular forms over Γ^0(2).
result Anomaly cancellation formulas derived for modular forms over Γ^0(2).
Study efficient inference for network quantile causal effects with partial interference.
problem Estimating network causal effects on outcome quantiles with partial interference.
method Developed a nonparametric efficiency theory and a nonparametrically efficient estimator using a three-way cross-fitting procedure.
result Proposed estimator is consistent, asymptotically normal, and allows flexible estimation of nuisance functions.
Spatial Deconfounder tackles interference and confounding in spatial data.
problem Interference and unmeasured spatial factors confound causal inference in spatial domains.
method Two-stage method using CVAE with spatial prior to reconstruct confounder, then estimate causal effects.
result Nonparametric identification of direct and spillover effects under weak assumptions.
Order cancellation process plays a crucial role in the dynamics of price formation in order-driven stock markets and is important in the construction and validation of computational finance models. Based on the order flow data of 18 liquid stocks traded on the Shenzhen Stock Exchange in 2003, we investigate the empiric…
Algorithm learns interference network and optimizes treatment allocation for unknown network effects.
problem Adaptive experimentation under unknown network interference.
method Thompson sampling algorithm with Gibbs sampler for joint learning of interference network and treatment allocation.
result Proves a Bayesian regret bound and achieves sublinear regret in real-world applications.
We give a direct proof of a cancellation formula raised in [7] on the level of differential forms. We also obtain more cancellation formulas for even dimensional Riemannian manifolds with a complex line bundle involved. Relations among these cancellation formulas are discussed.
For even dimensional manifolds, we prove some twisted anomaly cancellation formulas which generalize some well-known cancellation formulas. For odd dimensional manifolds, we obtain some modularly invariant characteristic forms by the Chern-Simons transgression and we also get some twisted anomaly cancellation formulas.
New proof shows Cohen-Lyndon property for non-metric small-cancellation.
problem Proving the Cohen-Lyndon property in non-metric settings.
method Generalized metric small-cancellation results.
result Cohen-Lyndon property holds for non-metric small-cancellation quotients.
Bayesian method estimates causal effects with proxy networks.
problem Estimating causal effects with only proxy measurements of a latent interference network.
method Structural causal model with Block Gibbs sampler and Locally Informed Proposals.
result Accurately estimates causal effects even with noisy proxy networks.
Machine learning method characterizes network interference in A/B tests.
problem Compromised A/B test reliability due to network interference.
method Causal network motifs and machine learning models.
result Outperforms conventional methods in characterizing network interference.
FRONT optimizes decisions with interference, reducing regret over time.
problem Short-sighted policies in online decision-making due to ignoring interference.
method FRONT considers long-term impacts of decisions, using exploratory and exploitative strategies.
result FRONT achieves sublinear regret in both immediate and consequential impacts.
New anomaly cancellation formulas for E8*E8*E8 gauge group.
problem Anomaly cancellation for E8*E8*E8 gauge group.
method Constructed modular forms over SL2(Z) to get new anomaly cancellation formulas.
result New anomaly cancellation formulas for characteristic forms.
The paper tackles adaptive targeting in networks with interference effects.
problem Adaptive targeting under network interference in a bandit setting.
method Linear model in a sparse regime, analyzing different levels of knowledge of the interference structure.
result Unified view of how knowledge of the interference structure affects online learning efficiency.
This article proposes and evaluates a technique to predict the level of interference in wireless networks. We design a recursive predictor that estimates future interference values by filtering measured interference at a given location. The predictor's parameterization is done offline by translating the autocorrelation…
New anomaly formulas from E8 bundles.
problem Anomaly cancellation in characteristic forms.
method Constructing modular forms using E8 bundles.
result New anomaly cancellation formulas.
A new method reduces task interference in model merging.
problem Model merging overlooks structural information and is susceptible to task interference.
method Task Singular Vectors (TSV) and TSV-Compress for compression and interference reduction.
result TSV-Merge significantly outperforms existing methods.
Interference effects of tall buildings have attracted numerous studies due to the boom of clusters of tall buildings in megacities. To fully understand the interference effects of buildings, it often requires a substantial amount of wind tunnel tests. Limited wind tunnel tests that only cover part of interference scena…
By studying modular invariance properties of some characteristic forms, we prove some new anomaly cancellation formulas which generalize the Han-Zhang and Han-Liu-Zhang anomaly cancellation formulas
New modular forms for anomaly cancellation formulas on any dimensional manifolds.
problem Constructing new modular forms for anomaly cancellation formulas.
method Using E8 bundles, constructing modular forms on any dimensional manifolds. result Derived new anomaly cancellation formulas and applications.
New algorithm minimizes regret in multi-armed bandits with network interference.
problem Minimizing regret in online experiments with network interference.
method Sparse network interference model, discrete Fourier analysis, linear regression-based algorithms.
result Provable low regret algorithms for sparse interference networks.
This paper examines the value of a cancellable European option in a finite time horizon setting. The specifications of this generalized European option allow the seller to cancel the option at any point in time for a fixed penalty paid directly to the holder. Here, we provide an explicit valuation formula for the Europ…
This paper investigates weight-sharing in NAS, revealing its impact and providing solutions.
problem Reducing the time and computational cost of training neural networks.
method Comprehensive experiments on weight-sharing in NAS, analyzing variance and interference.
result Properly reducing weight sharing can reduce variance and improve model performance.
New method improves causal inference by estimating complex treatment effects with active learning.
problem Traditional causal inference frameworks ignore interference and assume independent treatment effects.
method Active Learning in Causal Inference with Interference (ACI) using Gaussian process and genetic algorithms.
result ACI achieves accurate effects estimation with reduced data requirements in complex interference scenarios.
New framework for estimating treatment effects in experiments with network interference.
problem Network interference biases traditional treatment effect estimations in randomized experiments.
method Causal message-passing framework based on high-dimensional approximate message passing.
result Practical algorithm to estimate total treatment effect in multi-period experiments.