We propose a framework for the derivation and evaluation of distributed iterative algorithms for receiver cooperation in interference-limited wireless systems. Our approach views the processing within and collaboration between receivers as the solution to an inference problem in the probabilistic model of the whole sys…
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,341 papers · 148 categories
Trend · papers per month
48 results for “probabilistic receiver”
New probabilistic receiver combines BP, MF, and EP for multi-signal detection.
problem Ineffective MF approximation for multi-signal detection.
method Developed a new factor graph construction and low-complexity variant of BP-MF for multi-signal detection.
result Probabilistic receiver architecture with strong theoretical justification for multi-signal detection.
Iterative information processing, either based on heuristics or analytical frameworks, has been shown to be a very powerful tool for the design of efficient, yet feasible, wireless receiver architectures. Within this context, algorithms performing message-passing on a probabilistic graph, such as the sum-product (SP) a…
Model aggregates answers with peer predictions, inferring world states.
problem Aggregating answers from multiple respondents without assuming consensus correctness.
method Probabilistic model incorporating respondent signals and predictions.
result Model infers world states and respondent expertise, outperforming other models.
We design iterative receiver schemes for a generic wireless communication system by treating channel estimation and information decoding as an inference problem in graphical models. We introduce a recently proposed inference framework that combines belief propagation (BP) and the mean field (MF) approximation and inclu…
New algorithm minimizes regret in multi-agent bandit problem with probabilistic communication.
problem Minimizing group regret in multi-agent multi-armed bandit problem with probabilistic communication.
method Proposes a new UCB-based algorithm for decentralized multi-agent multi-armed bandit problem on -regular graphs with probabilistic communication.
result The proposed algorithm outperforms state-of-the-art algorithms in minimizing group regret.
From Sets to Multisets: Provable Variational Inference for Probabilistic Integer Submodular Modelscs.LG
New method for probabilistic modeling of integer submodular functions.
problem Lack of probabilistic modeling for integer submodular functions.
method Proposed Generalized Multilinear Extension and block-coordinate ascent algorithm.
result Demonstrated effectiveness and viability on real-world datasets.
Etalumis bridges scientific simulators and probabilistic programming.
problem Infeasibility of rewriting scientific simulators for Bayesian inference.
method Cross-platform probabilistic execution protocol, MCMC and IC engines, distributed training of 3DCNN-LSTM.
result Achieved largest-scale posterior inference in a Turing-complete PPL for LHC use-case.
Paper optimizes material microstructures with limited data using probabilistic methods.
problem Optimizing material properties with uncertain process-structure-property links.
method Flexible probabilistic formulation, data-driven surrogate, active learning.
result Significant improvement in accuracy with small training data.
Proposes a framework for learning constrained motor skills.
problem Learning constrained motor skills in robotic systems.
method Exploits probabilistic properties of multiple demonstrations in a linearly constrained optimization problem.
result Proposes a non-parametric solution for constrained motor skills.
Proposes and evaluates three diagnostic graphics for probabilistic classifiers.
problem Evaluating and comparing probabilistic classifiers.
method Triptych of diagnostic graphics: reliability diagram, ROC curve, Murphy diagram.
result Visual diagnostics reveal distinct aspects of forecast performance.
Improved learning of probabilistic box embeddings by modeling parameters with Gumbel distributions.
problem Local identifiability issues in geometric embeddings.
method Modeling box parameters with min and max Gumbel distributions, calculating expected intersection volume.
result Improves the ability of probabilistic box embeddings to learn.
A new method for efficient probabilistic meta-learning.
problem High-quality predictions with well-calibrated uncertainty estimates require large amounts of data.
method Amortised Inference in Bayesian Neural Networks (APOVI-BNN)
result The APOVI-BNN produces high-quality predictions with well-calibrated uncertainty estimates using significantly less data.
Proposes a new prior for VAEs to improve out-of-distribution detection.
problem Probabilistic generative models struggle with out-of-distribution detection.
method Introduces an exponentially tilted Gaussian prior for VAEs.
result Achieves state-of-the-art results on ROC-AUC metric.
Neural Calibration improves reliability of probabilistic predictions by learning from field-aware information.
problem Miscalibration of probabilistic predictions in machine learning models.
method Neural Calibration, a simple yet powerful post-hoc calibration method that learns from field-aware information.
result Neural Calibration significantly improves reliability in metrics like negative log-likelihood, Brier score, and AUC.
Efficiently combines probabilistic predictions using kernel embeddings.
problem Combining multiple probabilistic predictions to improve forecast accuracy.
method Embed predictions into RKHS, optimizes kernel-based scoring rules, finds efficient implementation.
result Generalised linear pool outperforms traditional linear pool in operational wind speed forecasts.
We integrate camera pose correlations into deep models using Gaussian processes.
problem Lack of inter-frame reasoning in deep neural networks.
method Derive a principled framework combining camera pose information with deep models using a novel view kernel.
result Soft-prior knowledge aids pose-related vision tasks like novel view synthesis.
Bayesian networks handle incomplete and changing data.
problem Handling incomplete and dynamic data.
method Review and application of Bayesian networks to incomplete and dynamic data.
result Bayesian networks can model dynamic and incomplete data.
Conditional independence tests (CI tests) have received special attention lately in Machine Learning and Computational Intelligence related literature as an important indicator of the relationship among the variables used by their models. In the field of Probabilistic Graphical Models (PGM)--which includes Bayesian Net…
Paper develops Gaussian process for distributions using Wasserstein distances.
problem Forecasting Gaussian processes indexed by probability distributions.
method Developed positive definite kernels based on Wasserstein distances.
result Efficient forecasting of Gaussian processes indexed by distributions.
This paper optimizes kernel and acquisition functions for high-dimensional Bayesian Optimization.
problem Bayesian Optimization struggles with high-dimensional problems due to computational inefficiency.
method The paper leverages the additionality of the objective function to map kernel and acquisition functions in lower-dimensional subspaces, improving efficiency.
result Efficient optimization of acquisition function in high-dimensional problems.
Proposes a new metric learning method for image recognition.
problem Improving image recognition performance using learned distance representations.
method Introduces a Generalized Hybrid Metric Loss (GHM-Loss) to learn hybrid proximity features combining geometric and probabilistic spaces.
result Demonstrates superior performance compared to existing methods on public datasets.
A new method for blind source separation using hierarchical structure and KL divergence.
problem Blind source separation of complex interacting signals.
method Hierarchical log-linear model with KL divergence minimization.
result Superior performance compared to existing techniques on images and time series data.
New framework for fair ranking with noisy protected attributes.
problem Errors in socially-salient attributes undermine fairness guarantees.
method Modeling perturbations in protected attributes and incorporating probabilistic information.
result Framework provides provable guarantees on fairness and utility.
SPIDER uses deep neural networks for streaming tensor factorization.
problem Lack of effective approach for deep tensor factorization of streaming data.
method Bayesian neural networks with spike-and-slab prior, Taylor expansions, moment matching, and EPI framework.
result Effective incremental updates for latent factors and NN weights.
Evidence acquisition costs influence disclosure behavior and preference.
problem How evidence acquisition costs affect disclosure behavior and preference.
method Analyzes sender-receiver interactions with covert and overt evidence acquisition, varying certification costs.
result Equilibria converge to the Pareto-worst free-learning equilibrium as costs vanish, and receivers prefer covert to overt acquisition.
This paper presents a ML-based receiver for SDR that outperforms conventional methods.
problem Complexity and performance issues in multiuser detection.
method Supervised learning for direct symbol detection without parameter estimation.
result The ML-based receiver achieves similar or better performance than SIC and MMSE receivers.
The paper combines Bitcoin price models with expert corrections for better predictions.
problem Improving Bitcoin price predictions using statistical and expert insights.
method Linear regression models combined with expert corrections, utilizing Bayesian approach for fat-tailed distributions.
result Better price prediction results compared to using either model or expert opinion alone.
On the Estimation Performance of Generalized Power Method for Heteroscedastic Probabilistic PCAmath.OC
Paper proposes GPM for heteroscedastic PCA estimation.
problem Estimating ground truth from heterogeneous data.
method Generalized power method (GPM) for HQPOC.
result GPM achieves geometrically decreasing distances to ground truth.
Enhances NOAA's Geospace model with machine learning for predicting ground magnetic perturbations.
problem Predicting the probability of ground magnetic field changes.
method Combining physics-based model with machine learning (boosted ensemble of classification trees).
result The ML-enhanced model consistently improves probabilistic forecast metrics.
AI improves OFDM receivers for robust real-world communication.
problem Performance gap between simulation and real-world OFDM systems.
method Comparison of AI-aided OFDM receivers and development of SwitchNet receiver.
result SwitchNet receiver adapts to real channels online, improving robustness.
The study forecasts hourly intraday electricity prices using ensemble methods.
problem Weak-form efficiency of hourly German Intraday Continuous Market prices.
method Probabilistic forecasting with ensemble trajectories, generalized additive model, and lasso penalty.
result The mixture model outperforms benchmarks in forecasting price distribution and volatility.
A new model improves analysis of neural activity from calcium imaging.
problem Statistical modeling of deconvolved calcium signals for neural activity interpretation.
method Proposed a zero-inflated gamma (ZIG) model to characterize calcium responses as a mixture of a gamma distribution and a point mass.
result The ZIG model outperforms simpler models in neural encoding and decoding problems.
One of the fundamental tasks of science is to find explainable relationships between observed phenomena. One approach to this task that has received attention in recent years is based on probabilistic graphical modelling with sparsity constraints on model structures. In this paper, we describe two new approaches to Bay…
Study on online CF with occasional positive ratings, finds p_f impacts sample complexity.
problem Online CF with limited positive feedback.
method Probabilistic user model, online user-based CF algorithm analysis.
result Sample complexity reduced by 1/p_f for initial exploration.
Bayesian neural networks are shown to be minimax and admissible under certain conditions.
problem Optimality of Bayesian neural networks in deep learning models.
method Analysis of decision rules induced by BNNs in the normal location model under quadratic loss.
result A hyperprior on the effective output variance yields a minimax and admissible decision rule.
Paper defends deep learning classifiers against channel-aware adversarial attacks.
problem Deep learning classifiers are vulnerable to adversarial attacks.
method Channel-aware adversarial attacks are presented and defended against.
result Certified defense based on randomized smoothing makes classifiers robust.
New method reduces SBL complexity from cubic to linear, improving scalability.
problem Sparse Bayesian Learning's high computational complexity for large feature spaces.
method DQN-SBL, a diagonal Quasi-Newton method for SBL.
result DQN-SBL achieves competitive generalization with sparse models, scaling well to large-scale problems.
New method optimizes MRI sampling patterns for faster scans.
problem Accelerate MRI scans without sacrificing image quality.
method Joint learning of adaptive sampling patterns and model-based recovery.
result Improved MR image quality compared to other methods.
Community detection in networks is a key exploratory tool with applications in a diverse set of areas, ranging from finding communities in social and biological networks to identifying link farms in the World Wide Web. The problem of finding communities or clusters in a network has received much attention from statisti…
Paper studies estimating network properties with missing data using SRL and GNN.
problem Estimating aggregate properties in networks with missing data attributes.
method Comparative study of SRL and GNN approaches for inferring missing attributes and estimating aggregate properties.
result SRL-based approaches tend to outperform GNN-based approaches in estimating aggregate properties and predictive accuracy.
Over-the-Air Adversarial Attacks on Deep Learning Based Modulation Classifier over Wireless Channelseess.SP
Adversaries can fool deep learning modulator classifiers over wireless channels.
problem Vulnerability of deep learning modulator classifiers to adversarial attacks over wireless channels.
method Presented various adversarial attacks considering channel effects, including targeted and non-targeted attacks, and a universal adversarial perturbation attack.
result Modulation classification is vulnerable to adversarial attacks over wireless channels with realistic channel effects.
Contextual PDA improves explanation of image classifications for saturated models.
problem Difficulty in explaining decisions of saturated classifiers.
method Proposes Contextual PDA, a faster method for explaining image classifications.
result Contextual PDA outperforms PDA in explaining image classifications of state-of-the-art deep networks.
Paper uses RNNs for more accurate indoor WiFi localization.
problem Accurate indoor WiFi localization using RSSI measurements.
method Proposes recurrent neural networks (RNNs) for trajectory positioning of RSSI data.
result Achieves an average localization error of 0.75 m with 80% under 1 m, outperforming conventional algorithms.
We propose a novel receiver for orthogonal frequency division multiplexing (OFDM) transmissions in impulsive noise environments. Impulsive noise arises in many modern wireless and wireline communication systems, such as Wi-Fi and powerline communications, due to uncoordinated interference that is much stronger than the…
Multiple kernel learning (MKL), structured sparsity, and multi-task learning have recently received considerable attention. In this paper, we show how different MKL algorithms can be understood as applications of either regularization on the kernel weights or block-norm-based regularization, which is more common in str…
A new experimental design method for combinatorial interventions reduces complexity and improves accuracy.
problem Efficiently conducting all possible combinatorial interventions with multiple treatments and potential interactions.
method Probabilistic factorial experimental design, applying random combinations of treatments and adapting over multiple rounds.
result Optimal dosage of 1/2 for each treatment yields near-optimal design for estimating any k-way interaction model.
New framework and method for online inverse reinforcement learning improves performance and speed.
problem Learning agent preferences from incremental observations in real-time applications.
method Incremental Inverse Reinforcement Learning (I2RL) with maximum entropy IRL for hidden variables.
result The new method has monotonically improving performance and probabilistically bounded error with more data.