We propose and analyze an online algorithm for reconstructing a sequence of signals from a limited number of linear measurements. The signals are assumed sparse, with unknown support, and evolve over time according to a generic nonlinear dynamical model. Our algorithm, based on recent theoretical results for ℓ1-$…
Data analysis in high energy physics often deals with data samples consisting of a mixture of signal and background events. The sPlot technique is a common method to subtract the contribution of the background by assigning weights to events. Part of the weights are by design negative. Negative weights lead to the diver…
Background-Foreground classification is a well-studied problem in computer vision. Due to the pixel-wise nature of modeling and processing in the algorithm, it is usually difficult to satisfy real-time constraints. There is a trade-off between the speed (because of model complexity) and accuracy. Inspired by the reject…
A new method avoids noise amplification when subtracting or dividing stochastic signals.
problem Noise amplification when subtracting or dividing stochastic signals.
method Normalizing flows to approximate the distribution of the signal of interest.
result Normalizing flows can generate an approximation of the probability distribution over the signal of interest, avoiding subtraction or division.
The paper solves video object segmentation without supervision using nonconvex optimization.
problem Unsupervised video object segmentation via background subtraction.
method Formulates the problem as a nonnegative variant of robust principal component analysis, ensuring global optimality under certain conditions.
result Conditions guaranteeing the uniqueness and global optimality of object segmentation are derived and demonstrated with real data.
A framework uses deep learning for activity recognition in IoT devices.
problem Activity recognition in IoT devices without physical contact.
method Background subtraction followed by 3D-Convolutional Neural Networks.
result Enhanced activity recognition using small IoT devices.
LCRSR recovers latent row space for multi-view clustering.
problem Efficiently recover latent representation from multiple views.
method LCRSR assumes latent representation from multiple views, recovers row space, and determines subspace membership.
result LCRSR recovers complete subspace structure efficiently.
There have been many attempts to define the notion of quasilocal mass for a spacelike 2-surface in spacetime by the Hamilton-Jacobi analysis. The essential difficulty in this approach is to identify the right choice of the background configuration to be subtracted from the physical Hamiltonian. Quasilocal mass should b…
Robust PCA methods are typically batch algorithms which requires loading all observations into memory before processing. This makes them inefficient to process big data. In this paper, we develop an efficient online robust principal component methods, namely online moving window robust principal component analysis (OMW…
It is well known that Principal Component Analysis (PCA) is strongly affected by outliers and a lot of effort has been put into robustification of PCA. In this paper we present a new algorithm for robust PCA minimizing the trimmed reconstruction error. By directly minimizing over the Stiefel manifold, we avoid deflatio…
New method uses subtractive mixture models for approximate inference.
problem How to effectively use subtractive mixture models for approximate inference.
method Design expectation estimators for IS and learning schemes for VI with SMMs.
result Empirical evaluation shows SMMs can approximate distributions effectively.
A new method estimates expectations from subtractive mixture models without sampling.
problem Estimating expectations from multimodal distributions using SMMs.
method Difference representation of SMMs to create unbiased IS estimator (ΔextEx). result Demonstrates that ΔextEx can achieve comparable estimation quality to auto-regressive sampling but is faster. Novel LRMC tackles missing data and outliers in large-scale low-rank data recovery.
problem Missing data and extreme outliers in low-rank data analysis.
method Learned Robust Matrix Completion (LRMC) using deep unfolding and flexible neural network framework.
result LRMC achieves optimum performance with low computational complexity and linear convergence.
The paper analyzes the score field of diffusion models using Burgers dynamics.
problem Understanding the evolution of score fields in diffusion models.
method Analyzes the score field through Burgers-type evolution law for diffusion models.
result Identifies a universal \( anh\) interfacial term in the score field.
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of l_2- or l_infinity-norms over groups of variables. Whereas much effort has been put in developing fast optimization techniques when the groups are disjoint or embedded in a hierarchy, we address here the ca…
ADS explains object differences by quantifying and removing underlying properties.
problem Explaining differences between two object images.
method Align-Deform-Subtract (ADS) framework that uses semantic alignments and iterative quantification/removal of differences.
result ADS provides disentangled error measures explaining object differences in terms of underlying properties.
Proposes a flexible tournament design combining knockout and round-robin.
problem Designing a tournament that eliminates participants linearly.
method Combines knockout and round-robin structures for flexible elimination.
result Flexible tournament design can eliminate participants linearly.
The high-dimensional data setting, in which p >> n, is a challenging statistical paradigm that appears in many real-world problems. In this setting, learning a compact, low-dimensional representation of the data can substantially help distinguish signal from noise. One way to achieve this goal is to perform subspace le…
This paper studies adversarial attacks on Gaussian process bandits.
problem Adversarial attacks on Gaussian process bandits to manipulate optimal function regions.
method Proposes various adversarial attack methods on GP bandits, including white-box and black-box attacks.
result Adversarial attacks can force GP bandits to optima in target regions even with low attack budgets.
Iterative subtraction method outperforms other feature ranking techniques in high-energy physics.
problem Determining the most important features for classification in high-energy physics experiments.
method Comparison of feature ranking methods including Iterative Addition, Iterative Removal, and BDT Selection Frequency.
result Iterative Removal method is the most efficient for feature ranking in classification tasks.
LoRA- improves EFCL by stabilizing feature drifts.
problem Catastrophic forgetting in exemplar-free continual learning.
method LoRA-subtraction to adaptively subtract old task weights.
result LoRA- achieves state-of-the-art performance in EFCL.
Dictionary learning and component analysis are part of one of the most well-studied and active research fields, at the intersection of signal and image processing, computer vision, and statistical machine learning. In dictionary learning, the current methods of choice are arguably K-SVD and its variants, which learn a …
Improved speech recognition model with better performance.
problem Speech recognition accuracy on Librispeech.
method Integrates an external language model with an internal LM correction.
result Over 14% relative improvement in performance.
New method improves tensor completion by selectively preserving important elements.
problem Recovering corrupted high-dimensional tensor data with missing entries and noise.
method Tensor weighted correlated total variation (TWCTV) regularizer with ADMM algorithm.
result Superior performance in image completion, denoising, and background subtraction tasks.
Dictionary learning and component analysis models are fundamental for learning compact representations that are relevant to a given task (feature extraction, dimensionality reduction, denoising, etc.). The model complexity is encoded by means of specific structure, such as sparsity, low-rankness, or nonnegativity. Unfo…
Study sample complexity of robust binary hypothesis testing under different contamination models.
problem Analyzing the sample complexity of robust binary hypothesis testing under various contamination models.
method Examined three standard contamination models: ε-additive (Huber), ε-subtractive, and ε-total variation (TV). Provided explicit formulas for least favourable distributions and compared sample complexities across models.
result Sample complexities are highly unstable in the contamination parameter ε and comparable up to constant-factor rescaling of ε across models.
We consider bosonic supersymmetric backgrounds of ten-dimensional conformal supergravity. Up to local conformal isometry, we classify the maximally supersymmetric backgrounds, determine their conformal symmetry superalgebras and show how they arise as near-horizon geometries of certain half-BPS backgrounds or as a plan…
Derives path-integrals for superstrings on curved backgrounds using string geometry theory.
problem Calculating path-integrals for superstrings on curved backgrounds.
method Derives path-integrals from string geometry theory by considering fluctuations around string backgrounds.
result Derives path-integrals for perturbative superstrings on all string backgrounds.
Derives path integrals for perturbative strings on various backgrounds.
problem Calculating path integrals for strings on curved backgrounds.
method Derives path integrals from string geometry theory by considering fluctuations around string backgrounds.
result Derives path integrals of all order perturbative strings on various backgrounds.
The study explores highly supersymmetric backgrounds in 11D supergravity.
problem Understanding and constructing highly supersymmetric backgrounds in 11D supergravity.
method Definition of abstract symbols and a strong version of the Reconstruction Theorem, proposing a strategy to construct backgrounds, and providing an example with detailed computation.
result Bijective correspondence between highly supersymmetric backgrounds and abstract symbols, and a classical supersymmetry gap result.
We describe the construction of a Lie superalgebra associated to an arbitrary supersymmetric M-theory background, and discuss some examples. We prove that for backgrounds with more than 24 supercharges, the bosonic subalgebra acts locally transitively. In particular, we prove that backgrounds with more than 24 supersym…
New framework uses background knowledge to speed up causal discovery.
problem Scalable causal discovery for large datasets.
method Utilizes background knowledge during causal discovery process.
result Background knowledge reduces computational requirements and improves structure quality.
SRTC model for background/foreground separation with missing pixels.
problem Background/foreground separation with missing pixels in videos.
method Smooth robust tensor completion (SRTC) model with tensor proximal alternating minimization (tenPAM).
result Global convergence guarantee for the proposed algorithm.
Improved action recognition in live videos with hybrid FR-DL method.
problem High computational costs and lack of temporal information in conventional action recognition.
method Automated selection of representative frames, feature extraction, background subtraction, HOG, deep neural network, LSTM, Softmax-KNN classifier.
result Significant improvement in accuracy and speed compared to state-of-the-art methods.
Study optimal reinsurance for insurers with a reinsurer's default risk.
problem Optimal reinsurance for insurers with a reinsurer's default risk.
method Analytical solution for two types of reinsurance contracts.
result Joint effect of reinsurer's default and background risk on reinsurance demand.
We extend the Falceto-Zambon version of Marsden-Ratiu Poisson reduction to Poisson quasi-Nijenhuis structures with background on manifolds. We define gauge transformations of Poisson quasi-Nijenhuis structures with background, study some of their properties and show that they are compatible with reduction procedure. We…
Motivated by the search for new gravity duals to M2 branes with N>4 supersymmetry --- equivalently, M-theory backgrounds with Killing superalgebra osp(N∣4) for N>4 --- we classify homogeneous M-theory backgrounds with symmetry Lie algebra so(n)⊕so(3,2) for n=5,6,7. We f…
We explore all warped AdS4×wMD−4 backgrounds with the most general allowed fluxes that preserve more than 16 supersymmetries in D=10- and 11-dimensional supergravities. After imposing the assumption that either the internal space MD−4 is compact without boundary or the isometry algebra of the back…
A new method reduces speckles in high contrast imaging.
problem Over-subtraction from speckles and self-subtraction in data reduction.
method Data Imputation concept using Karhunen-Loève transform (DIKL).
result DIKL achieves high-quality results with significantly reduced computational cost.
Generative Adversarial Networks generate PXD background noise efficiently.
problem Efficiently generate statistically independent PXD background noise samples.
method Conditional Generative Adversarial Networks (GANs) with contrastive learning.
result On-demand PXD background generator reduces storage requirements.
Heterotic backgrounds described using generalised geometry, preserving minimal supersymmetry.
problem Characterizing heterotic backgrounds preserving minimal supersymmetry in four dimensions.
method Using generalised geometry, characterizing backgrounds by an SU(3)imesSpin(6+n) structure and an involutive subbundle of the generalised tangent bundle. result The analysis of infinitesimal deformations reproduces known cohomologies of massless moduli.
Background doesn't affect personality predictions in deep networks.
problem Understanding how background images influence personality attribution in deep learning models.
method Explicitly studied the effect of background images on personality prediction in deep residual networks, controlling for confounds.
result Adding background information to input decreases model performance for personality trait prediction.
The paper examines how background risk affects portfolio selection and optimal reinsurance design.
problem Maximizing the probability of reaching a financial goal in the presence of background risk.
method Quantile formulation method to derive optimal solutions explicitly.
result The presence of background risk does not change the solution shape but alters the parameter values.
We prove that supersymmetry backgrounds of (1,0) and (2,0) six-dimensional supergravity theories preserving more than one half of the supersymmetry are locally homogeneous. As a byproduct we also establish that the Killing spinors of such a background generate a Lie superalgebra.
In this paper we study homogeneous backgrounds of type IIB supergravity where the underlying geometry is that of a symmetric space. We determine which ten-dimensional lorentzian symmetric spaces (up to local isometry) admit such backgrounds and in about two thirds of the cases we determine fully their moduli space.
New method separates market motion from stock correlations.
problem Understanding the dynamics of stock correlations relative to market motion.
method Cluster reduced-rank correlation matrices by subtracting the largest eigenvalue.
result Extracted market states are quasi-stationary over long periods.
Defines Killing spinors and bosonic backgrounds in 5D supergravity.
problem Characterizing backgrounds in 5D supergravity.
method Calculates Spencer cohomology, defines Killing spinors, and imposes constraints on spinor connection curvature.
result Recover field equations of 5D supergravity and find new field equations for sp(1)-valued one-form. PCA++ improves robustness to background noise in contrastive learning.
problem Recovering shared signal subspaces from positive pairs in high-dimensional data with structured background noise.
method PCA++ uses hard uniformity-constrained contrastive learning to enforce identity covariance on projected features.
result PCA++ outperforms standard PCA and alignment-only PCA+ in simulations and real-world datasets.