A group of transition probability functions form a Shannon's channel whereas a group of truth functions form a semantic channel. Label learning is to let semantic channels match Shannon's channels and label selection is to let Shannon's channels match semantic channels. The Channel Matching (CM) algorithm is provided f…
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,051 papers · 148 categories
Trend · papers per month
48 results for “Channels Matching”
CM algorithm improves MMI classifications for unseen instances.
problem Improving classification accuracy for unseen instances using MMI criterion.
method Introduces CM algorithm for MMI classifications, combining semantic and Shannon channels for matching.
result Achieves high mutual information (99%) with minimal iterations in low-dimensional feature spaces.
Paper proposes online learning for MIMO channel estimation using neural networks.
problem Challenges in MIMO channel estimation due to physical model simplifications and system configuration requirements.
method Unfold a channel estimation algorithm as a neural network, allowing online learning and correction of imperfect models.
result Achieves channel estimation error close to that of a perfectly calibrated system.
A group of transition probability functions form a Shannon's channel whereas a group of truth functions form a semantic channel. By the third kind of Bayes' theorem, we can directly convert a Shannon's channel into an optimized semantic channel. When a sample is not big enough, we can use a truth function with paramete…
Deep learning improves history matching of complex facies models.
problem Preserving geological realism in reservoir models with complex facies distributions.
method Convolutional variational autoencoder and ensemble smoother with multiple data assimilation.
result The parameterization generated well-defined channelized facies, outperforming previous methods.
HKF uses neural networks to adapt Kalman filters for dynamic channel tracking.
problem Tracking channels with varying dynamics and Doppler values.
method Combines Kalman filters with hypernetworks for dynamic adaptation.
result HKF achieves up to 2dB gain over Kalman filters at high Doppler values.
PruneNet efficiently prunes channels in deep networks, improving accuracy and performance.
problem Improving deep neural network performance and efficiency through channel pruning.
method PruneNet uses a computationally light-weight optimization step to identify and prune channels based on layer redundancy.
result Pruned ResNet models achieve higher accuracy and better performance than non-pruned models.
New algorithm solves Schrödinger bridge problem with mismatched channels.
problem Solving Schrödinger bridge problem with input and noise channel mismatch.
method Design of a Sinkhorn recursion with memory for nonlinear PDEs.
result Demonstrates solving control-affine Schrödinger bridge problem.
Tiled Squeeze-and-Excite improves channel attention with local spatial context.
problem Improving channel attention mechanisms in neural networks.
method Proposes tiled squeeze-and-excite (TSE) framework for channel attention.
result Local context of 7 rows or columns is sufficient for matching global context performance.
Free Energy Mixercs.CL
FEM improves attention mechanisms by applying value-driven log-linear tilts.
problem Standard attention mechanisms read via convex average, limiting channel-wise selection.
method Free Energy Mixer (FEM) applies a value-driven, per-channel log-linear tilt to a fast prior over indices.
result FEM outperforms strong baselines on NLP, vision, and time-series tasks.
Paper develops efficient recursive learning for multi-channel systems with heterogeneous dynamics.
problem Accurately learning system dynamics in complex, multi-channel systems with nonlinear and noisy data.
method Formulates system as Gaussian process state-space models (GPSSMs), introduces heterogeneous multi-output kernel, and develops recursive inference framework.
result Matches SOTA offline GPSSMs in accuracy with 1/100 runtime, and outperforms SOTA online GPSSMs by 70% in accuracy under noise with 1/20 runtime.
In this paper, we investigate cost-aware joint learning and optimization for multi-channel opportunistic spectrum access in a cognitive radio system. We investigate a discrete time model where the time axis is partitioned into frames. Each frame consists of a sensing phase, followed by a transmission phase. During the …
AutoShuffleNet learns permutation matrices in CNNs for improved accuracy.
problem Manual design of channel shuffling in ShuffleNet.
method Learning permutation matrices via an exact Lipschitz continuous penalty in deep learning.
result Improved classification accuracies on CIFAR-10 and ImageNet datasets.
FedMA improves federated learning for neural nets, matching and averaging model elements.
problem Federated learning's communication burden and model performance.
method Layer-wise construction of shared model by matching and averaging hidden elements.
result FedMA outperforms state-of-the-art algorithms on deep CNN and LSTM architectures.
Misspecification-Aware Simulation-Based Inference via Side-Channel Guidance
problem Simulation-based inference (SBI) of latent parameters is hindered by simulator misspecification.
method Misspecification-Aware Simulation-Based Inference (MA-SBI) turns side-channel text into a posterior correction.
result MA-SBI matches the oracle posterior across 10 seeds and two backbones.
Hybrid deep learning model predicts urban floods with high accuracy.
problem Urban flood prediction and situation awareness using channel network sensors data.
method FastGRNN-FCN hybrid deep learning model trained on Harris County, Texas flood data.
result Test accuracy and F-measure reach 97.8% and 0.792, respectively.
Statistical framework for inexact graph matching with errorfully observed graphs.
problem Finding a correspondence between graphs with errors.
method Introducing a corrupting channel model and using maximum likelihood estimation.
result Maximum likelihood estimation is a solution to the inexact graph matching problem.
In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary source via position modulation (PM). We then present a simple and …
IGSD separates task-specific content channels in transformer components by comparing activation replacement with zero ablation.
problem Mechanistic interpretability of transformer components
method IGSD: paired-intervention framework for comparing activation replacement with zero ablation
result IGSD identifies an early-layer content channel in transformer components that standard importance methods underestimate.
A new method normalizes activations to match batch normalization without batch dependence.
problem Performance degradation with batch-independent normalization techniques.
method Proxy-Normalizing Activations
result Proxy-Normalization technique emulates batch normalization's behavior and performance.
In many statistical problems, a more coarse-grained model may be suitable for population-level behaviour, whereas a more detailed model is appropriate for accurate modelling of individual behaviour. This raises the question of how to integrate both types of models. Methods such as posterior regularization follow the id…
New algorithm for active learning from feedback coding.
problem Efficiently selecting examples for labeling in active machine learning.
method Formalized structural similarities between active learning and feedback channel coding, developed an optimal transport-based algorithm called Approximate Posterior Matching (APM).
result Learning performance comparable to existing methods at reduced computational cost.
Unsupervised dehazing method using DCP improves performance.
problem Dehazing single images from haze using unsupervised learning.
method Minimizing Dark Channel Prior (DCP) energy function on real-world images.
result Method performs similarly to supervised methods.
The Expectation-Maximization (EM) algorithm for mixture models often results in slow or invalid convergence. The popular convergence proof affirms that the likelihood increases with Q; Q is increasing in the M -step and non-decreasing in the E-step. The author found that (1) Q may and should decrease in some E-steps; (…
Paper refutes EM convergence theory and introduces a new EM algorithm.
problem The convergence theory of the EM algorithm is incorrect and affects its performance.
method Proposes a new EM algorithm called the Channel Matching (CM) EM algorithm and provides an initialization map.
result The locally maximal Q can affect the convergent speed but not the global convergence.
A new channel locality block improves CNN performance.
problem Improving the performance of convolutional neural networks.
method Proposed a variant of Squeeze-and-Excitation block using convolutional layers to learn nearby channel correlation.
result Our C-Local block achieved higher accuracy than the standard SE block on the cifar-10 dataset.
FEDS distills LIC model knowledge into a lightweight student for efficient compression.
problem Efficiently compress images with high performance and low resources.
method FEDS combines feature alignment and entropy-based loss for lightweight compression.
result Student model matches teacher's performance while reducing parameters and speeding up.
Study optimal algorithms for recovering signals through inhomogeneous low-rank channels.
problem Recovering signals through an inhomogeneous low-rank matrix channel.
method Derive and analyze an approximate message-passing algorithm (AMP) and a spectral method.
result The AMP iteration matches the conjectured optimal computational phase transition.
Robust STAP with coprime arrays reduces clutter using sparse modeling.
problem Limited performance due to training samples support in practical applications.
method Two-stage approach: 1) RD virtual snapshot, 2) RD sparse measurement modeling with OMP-like recovery.
result Robust to prior knowledge errors, good clutter suppression performance.
Improved neural networks with conditional gating and reduced computational cost.
problem Training large capacity neural networks with high accuracy and low computational cost.
method Fine-grained channel gating using batch-shaping and residual blocks.
result Conditional gating improves network accuracy and computational efficiency.
Deep learning predicts V2I channel responses for high-mobility wireless communications.
problem Efficient channel estimation for high-mobility V2I communications.
method Developed a deep neural network-based channel prediction method.
result Deep neural networks can learn and predict V2I channel properties in real-time.
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…
A deep-learning-based surrogate model for data assimilation in dynamic subsurface flow problemscs.LG
Deep learning model predicts subsurface flow dynamics.
problem Predicting dynamic subsurface flow in channelized geological systems.
method Residual U-Net and Convolutional LSTM networks trained on pressure and saturation maps.
result Surrogate model accurately predicts pressure, saturation, and well rates for new realizations.
Combining deep learning and ensemble smoothers for better history matching.
problem Dealing with complex facies distributions in history matching.
method Using autoencoders and generative adversarial networks to parameterize facies models, applying distance-based localization.
result Improved history matching performance with deep learning parameterizations.
CN normalizes channels for better time series model performance.
problem Improper channel identification in time series models.
method Channel Normalization (CN) and its variants (ACN, PCN) using distinct affine transformations.
result Significant performance gains across various time series models.
Proposes dynamic channel pruning during neural network training.
problem Pruning neural networks during training to reduce computational cost and improve efficiency.
method Dynamic channel propagation to update channel utility values and selectively prune channels.
result Our scheme trains and prunes neural networks simultaneously, achieving superior performance.
A new DVAE architecture improves channel estimation by incorporating temporal correlations.
problem Improving the estimation of time-varying channels.
method Introducing k-MemoryMarkovVAE (k-MMVAE) architecture to learn temporal correlations.
result The k-MMVAE aided channel estimator outperforms other ML aided estimators.
Generative diffusion models improve channel sampling from limited data.
problem Challenges in channel modelling and data collection for wireless systems.
method Diffusion model with U-Net architecture for frequency domain synthesis.
result Stable training and diverse high-fidelity samples generated from true channel distribution.
Unsupervised Linear and Nonlinear Channel Equalization and Decoding using Variational Autoencoderscs.LG
New method uses VAEs for blind channel equalization and decoding.
problem Blind channel equalization and decoding without pilot symbols.
method Variational autoencoders (VAEs) for blind channel equalization and decoding.
result Significant improvement in error rate compared to existing methods.
BestChanID identifies the channel with maximal capacity using training sequences.
problem Identifying the channel with maximal capacity among several discrete memoryless channels.
method Formulated as a multi-armed bandit problem, proposed a capacity estimator, and developed gap-elimination algorithms.
result Guaranteed to output the DMC with the largest capacity with a desired confidence.
Modeling alignment as resource-limited cognitive processes, researchers derive performance bounds.
problem Systematic deviations in feedback-based alignment of large language models.
method Modeling alignment as a two-stage cascade given , with cognitive and total capacities.
result Capacity-coupled Alignment Performance Interval derived from Fano and PAC-Bayes bounds.
A privacy-preserving method for transmitting data over a wiretap channel using generative networks.
problem Privacy protection in communication over a wiretap channel.
method Data-driven approach using variational autoencoder (VAE)-based joint source channel coding (JSCC).
result The approach provides high reconstruction quality at the receiver while confusing the eavesdropper about the latent sensitive attribute.
New adaptive SGD algorithms for federated learning over physical channels.
problem Reducing communication cost in federated learning over physical channels.
method Proposed adaptive federated SGD algorithms considering channel noise and hardware constraints.
result Demonstrated convergence rates adaptive to stochastic gradient noise level.
Discrete channel surfacesmath.DG
We present a definition of discrete channel surfaces in Lie sphere geometry, which reflects several properties for smooth channel surfaces. Various sets of data, defined at vertices, on edges or on faces, are associated with a discrete channel surface that may be used to reconstruct the underlying particular discrete L…
New ML models improve VVLC channel characterization for vehicular OWC.
problem Inaccurate channel models for VVLC due to mobility effects.
method Machine learning (ML) models incorporating ambient light, turbulence, and reflection effects.
result ML models predict VVLC channel loss and CFR more accurately than existing methods.
VAE leverages MMSE channel estimation with data-driven modeling.
problem Data-driven channel estimation for wireless communications.
method Variational autoencoder (VAE) modeling of channel distribution and LMMSE approximation.
result VAE-based channel estimators approximate MMSE performance with practical training methods.
Paper improves channel charting using autoencoders with spatial constraints.
problem Improving logical positioning of UEs using channel-state information.
method Representation-constrained autoencoders to enhance channel charts.
result Improved quality of learned channel charts for UE positioning.
New study shows feedback doesn't improve MAB performance over erasure channels.
problem Distributed multi-armed bandit problem with arm erasure channels.
method Analyzed MAB with feedback and erasure channels, proving no improvement in regret.
result Regret lower bound of Ω(√KT + K / (1 - ε)) matches no-feedback upper bounds.