New method learns signals from binary measurements, surpassing existing techniques.
problem Learning signals from noisy, incomplete, and quantized binary measurements.
method Self-supervised learning approach (SSBM) for binary data.
result SSBM outperforms supervised learning and sparse reconstruction methods.
QNNs can't distinguish binary signals from their negations, revealing a new symmetry.
problem Understanding the behavior of QNNs in binary pattern classification.
method Presented and analyzed a new form of invariance (negational symmetry) in QNNs.
result QNNs cannot differentiate a quantum binary signal and its negational counterpart in binary classification tasks.
Machine learning for entropy calculation from binary signals.
problem Calculating entropy from binary configurations/signals.
method Transformed entropy calculation into supervised classification tasks using machine learning.
result Reproduced entropy and free energy of the 2D Ising model.
Majority voting neural networks improve binary compressed sensing for sparse signal recovery.
problem Sparse signal recovery in binary compressed sensing.
method Majority voting neural networks with a cross entropy-like term and L1 regularization.
result The majority voting neural network achieves excellent recovery performance, approaching optimal performance as the number of component nets grows.
The paper proposes a least squares method for binary compressive sampling with low intrinsic dimension signals.
problem Recovering signals from binary measurements with noise and sign flips.
method Least squares decoder for signals with low generative intrinsic dimension.
result The least squares decoder achieves a sharp estimation error of O ( k log ( L n ) m ) O(\sqrt{\frac{k\log (Ln)}{m}}) O ( m k l o g ( L n ) ) under certain conditions. Two binary matrix factorization methods using dictionary learning are proposed.
problem Efficiently factorizing binary matrices for various applications.
method Binary adaptation of dictionary learning for binary matrices, focusing on speed and scalability.
result Effective factorizations of various data types produced.
Binary encoding enables neural networks to extrapolate periodic functions.
problem Extrapolating periodic functions without prior knowledge of their form.
method Normalized Base-2 Encoding (NB2E) for continuous numerical values.
result MLPs using NB2E can successfully extrapolate diverse periodic signals.
Study robust learning of Lipschitz functions under corrupted binary signals.
problem Learning a Lipschitz function with corrupted binary signals in a context of unknown corruption rounds.
method Introduced agnostic checking and new analysis techniques to design algorithms for symmetric and pricing losses.
result Achieved small cumulative loss for both symmetric and pricing losses.
MCLNN improves audio classification with binary masks.
problem Improving audio classification accuracy.
method Binary mask applied to CLNN for feature preservation and combination exploration.
result Competitive recognition accuracies on GTZAN and ISMIR2004 datasets.
Machine learning helps create accurate models of neutron star postmerger signals.
problem Creating accurate postmerger waveforms for binary neutron stars is challenging due to theoretical uncertainties and limited numerical simulations.
method Used a conditional variational autoencoder (CVAE) to construct postmerger models based on numerical-relativity simulations.
result The CVAE can accurately generate postmerger waveforms and encode the neutron star equation of state.
This research uses machine learning to approximate ideal and hotelling observer performance for binary signal detection.
problem Approximating the Ideal and Hotelling Observers for binary signal detection tasks.
method Supervised learning methods, including CNNs and SLNNs, are employed to approximate the IO and HO test statistics.
result The proposed supervised learning methods provide accurate approximations of the IO and HO test statistics.
New method for robustly recovering sparse signals from noisy data.
problem Recovering sparse signals from corrupted measurements with outliers.
method Sparse Bayesian learning with binary indicator hyperparameters and hierarchical priors.
result The method achieves better performance than existing techniques.
Binary feedback outperforms ordinal comparisons in ranking recovery.
problem Challenges the conventional wisdom that ordinal comparisons offer richer information.
method Proposes a parametric framework for modeling ordinal paired comparisons, binarizing ordinal data, and proving faster convergence rates for binary comparisons.
result Binarizing ordinal data significantly improves ranking recovery accuracy and exhibits a substantial performance gap.
A method extracts binary features directly from CS measurements for compressive image classification.
problem Efficiently classify images using compressive sensing without reconstruction.
method DCT-based approach for binary feature extraction from CS measurements, feature fusion with CNN features.
result Fused features outperform state-of-the-art methods in image classification.
VFPred combines signal processing and machine learning for VF detection from short ECG signals.
problem Detecting Ventricular Fibrillation from short ECG signals.
method VFPred uses Empirical Mode Decomposition, Discrete Time Fourier Transform, and Support Vector Machine.
result VFPred achieves high sensitivity and specificity even from short 5-second signals.
Paper tackles 1-bit compressed sensing, presenting efficient algorithm for sparse signal estimation.
problem Estimating sparse signals from binary measurements.
method Non-convex sparsity-constrained program with one-shot hard thresholding.
result Simple algorithm produces accurate signal approximation with high probability.
Approximate Message Passing (AMP) has been shown to be an excellent statistical approach to signal inference and compressed sensing problem. The AMP framework provides modularity in the choice of signal prior; here we propose a hierarchical form of the Gauss-Bernouilli prior which utilizes a Restricted Boltzmann Machin…
Paper models trading strategies to minimize latency arbitrage.
problem Minimizing latency in financial trading.
method Develops a gametheoretic model of trading behavior with binary signaling and different coding schemes.
result Identifies different Nash equilibria based on channel noise.
Active learning improves EDFA model accuracy with binary features.
problem Lack of labeled training data for EDFA devices.
method Active learning strategy for binary features using sparse linear models.
result Improved prediction and accelerated query generation.
Algorithm for efficiently combining many alpha signals.
problem Optimizing weights for a large number of alpha signals.
method Explicit algorithm with linear operation scaling, avoiding matrix inversion.
result Optimization cost scales linearly with the number of alphas (N).
New method approximates Ideal Observer using GANs and MCMC.
problem Intractable computation of Ideal Observer test statistic.
method Applying MCMC to SOMs learned by GANs.
result Extends applicability of MCMC for IO performance.
CNN predicts epileptic seizures from iEEG signals.
problem Accurately forecasting epileptic seizures to reduce patient uncertainty.
method Used a CNN for seizure prediction without hand-crafted features.
result CNN models outperformed previous methods on public datasets.
We tackle binary tensor decomposition with a multilinear model and likelihood-based estimation.
problem Decomposing binary tensors with probabilistic models.
method Multilinear Bernoulli model, rank-constrained likelihood estimation, alternating optimization.
result The estimation error bound is established and shown to be minimax optimal.
UniPhyNet improves cognitive load classification accuracy using EEG, ECG, and EDA signals.
problem Classifying cognitive load using multimodal physiological data.
method Unified network architecture integrating multiscale parallel convolutional blocks, ResNet-type blocks, and channel block attention module. Uses bidirectional gated recurrent unit for temporal dependencies.
result Improves raw signal classification accuracy from 70% to 80% (binary) and 62% to 74% (ternary) on CL-Drive dataset.
Study the tradeoff between signal distortion and human perception over finite channels.
problem Characterize the distortion-perception tradeoff for finite channels with arbitrary metrics.
method Solve linear programming problems to compute the distortion-perception function and optimal reconstructions.
result DP function is piecewise linear in the perception index.
Linearized probit regression matches nonlinear methods in accuracy.
problem Binary regression accuracy with nonlinear methods.
method Linearizing probit model with linear estimators.
result Linearized estimators perform similarly to nonlinear methods.
Study shows proper initialisation of binary weights is crucial for deep neural networks.
problem Training stochastic binary neural networks with continuous surrogates is challenging.
method Developed new surrogates based on Markov chain theory and mean field analysis.
result Critical initialisations are necessary for training deep networks with binary weights.
Modeling and estimating dynamic graphs from binary pattern sequences.
problem Extracting dominant correlation structures from time-dependent binary patterns.
method State-space model of an Ising-type network composed of multiple undirected graphs, sequential Bayes algorithm.
result The method outperforms traditional methods in uncovering overlapping graphs and estimating dynamics of weights.
This paper improves SNN training by using multiple sample compartments.
problem Training SNNs with single-sample estimators leads to inaccurate log-likelihood estimates.
method Proposes a GEM-based online learning algorithm that uses multiple independent spiking signals.
result Significant improvements in log-likelihood, accuracy, and calibration with multiple compartments.
Binary Iterative Hard Thresholding converges with optimal number of 1-bit measurements.
problem Recovering sparse signals from 1-bit compressed measurements.
method Binary Iterative Hard Thresholding (BIHT) algorithm.
result BIHT converges with only O(k/ε) measurements, optimal for recovery.
New method for efficient graph signal sampling and reconstruction.
problem Minimizing MSE in graph signal reconstruction with noisy data.
method Formulated as binary constraint minimization, approximated via SDP relaxation and greedy algorithm.
result Randomized greedy algorithm provides near-optimal subset with significant speedup.
We recover regression coefficients from unlabeled binary outcomes using a surrogate variable.
problem Recovering regression coefficients from unlabeled binary outcomes.
method Fit a least squares LASSO estimator to the subset of the observed data on $(oldsymbol{X}, S)$ restricted to the extreme sets of S S S , with Y Y Y imputed using the surrogacy of S S S . result Sharp finite sample performance bounds for the estimator, including deterministic deviation bounds and probabilistic guarantees.
A method using competitive experience replay enhances learning from sparse rewards.
problem Learning from sparse rewards in reinforcement learning.
method Competitive experience replay method that augments sparse rewards through an exploration competition between agents.
result The method leads to faster convergence and improved task performance.
Paper extends FOFC algorithm to work with mixed data types.
problem Designing causal discovery algorithms for mixed data types.
method Proves tetrad constraint can be entailed for mixed data types and applies FOFC algorithm.
result FOFC algorithm can work on mixed data types.
TRP uses tree-based approach for market-neutral portfolios.
problem Creating non-binary, market-neutral portfolios with signed signals.
method Tree-based portfolio construction with minimum-spanning-tree and sector-anchored variants.
result TRP outperforms HRP in preserving signal direction and managing exposures.
New algorithm separates audio sources better using alpha-stable distributions.
problem Improving audio source separation using complex distributions.
method Estimating mixtures of alpha-stable distributions using characteristic function matching.
result Better separation performance than Gaussian-based methods.
Proposes a new method for logistic PCA to avoid overfitting.
problem Overfitting in logistic PCA for binary data.
method Non-convex singular value thresholding for logistic PCA.
result Proposed method outperforms models with convex penalties.
New binary loss functions improve density ratio estimation accuracy.
problem Improving accuracy of density ratio estimators using binary classifiers.
method Characterized loss functions based on prescribed error measures in Bregman divergences.
result Novel loss functions prioritize accurate estimation of large density ratio values.
Enhances preference learning by incorporating response times into binary choices.
problem Limited information from binary choices about preference strength.
method Combines choices and response times using the EZ diffusion model.
result Response times improve utility estimation for strong preferences.
We propose a Bayesian expectation-maximization (EM) algorithm for reconstructing Markov-tree sparse signals via belief propagation. The measurements follow an underdetermined linear model where the regression-coefficient vector is the sum of an unknown approximately sparse signal and a zero-mean white Gaussian noise wi…
Robust algorithm identifies sparse signals using L2 regularization.
problem Reconstructing sparse signals from noisy data using overcomplete dictionaries.
method Corrected Projections Algorithm (CPA) with L2 regularization.
result CPA efficiently identifies known atoms in noisy signals.
Our paper examines binary linear classification under Gaussian mixtures, revealing conditions for optimal performance.
problem Understanding the conditions for optimal performance of binary linear classifiers under Gaussian mixtures.
method We study max-margin SVM and min-norm interpolating classifiers, deriving bounds and conditions for optimal performance.
result Interpolating estimators achieve asymptotically optimal performance under certain conditions, emphasizing the role of SNR and covariance.
Deep learning improves GW signal detection efficiency and robustness.
problem Traditional matched-filtering techniques are limited in detecting new GW signals.
method Optimized CNN models with techniques like batch normalization and dropout.
result CNN models are robust to the variation of GW waveform parameters.
Automatically builds a vehicle passage classifier using LSTM-RNNs.
problem Vehicle passage detection using complex sensor data.
method Automatic construction of a binary classifier based on LSTM-RNNs.
result Demonstrated that automatic RNN training can replace handcrafted classifiers.
This work extends score-based methods to binary data on the Boolean hypercube.
problem Learning and sampling binary data on the Boolean hypercube.
method Adopting Bernoulli noise as a smoothing device, deriving a TMF-like expression for the optimal denoiser, and using a Langevin-like sampler.
result The method successfully samples noisy binary data and reduces effective noise through multiple measurements.
New method optimizes sampling for spatial signals by balancing sample count and travel distance.
problem Optimizing sampling for spatial signals with varying costs.
method Quantile search for balancing sample count and travel distance.
result Quantile search method outperforms existing algorithms in practical scenarios.
Improves GAN training by guiding the discriminator to have more diverse binary activation patterns.
problem Stability and convergence issues in GAN training.
method Binarized Representation Entropy (BRE) regularization to guide the discriminator's model capacity allocation.
result Improves GAN training stability and convergence speed, higher sample quality, and higher classification accuracy.
New method infers viral load from pooled tests.
problem Inefficient viral load inference in pooled testing.
method Message passing algorithm with PCR noise function.
result Accurate viral load inference possible.