PCA minor projection is most sensitive to distributional changes in bivariate data.
problem Detecting sparse distributional changes in high-dimensional data.
method Proved that the minor projection of PCA-rotated data is most sensitive to distributional changes defined by Hellinger distance.
result The minor projection is the most sensitive to sparse distributional changes in high-dimensional data.
Meta-learn causal structures based on adaptation speed to sparse distributional changes.
problem Learning cause-effect relationships from sparse distributional changes.
method Meta-learn causal structures based on adaptation speed to modified distributions.
result Sparse expected gradients and lower effective degrees of freedom lead to faster adaptation.
New method combines domain changes and sparse mixing for better latent variable learning.
problem Challenges in identifying latent variables due to insufficient domain changes and violated sparsity constraints.
method Combines sufficient changes and sparse mixing constraints, using domain encoding networks and variational autoencoders.
result Identifiability of latent variables achieved with less restrictive constraints.
Estimates changes in parameters from sparse binomial observations.
problem Sparse observations of binomial parameters over a large population.
method Two-step procedure: MLE for joint distribution, then for change distribution and magnitude.
result Achieves optimal error bounds for estimating change distribution and magnitude.
Proposes MSS to identify causal structure from heterogeneous environments.
problem Distribution shifts between environments violate i.i.d. data assumption.
method Sparse mechanism shift hypothesis, score-based approach.
result Identifies entire causal structure with high probability.
Domain adaptation framework identifies latent variables for target distribution identifiability.
problem Unsupervised domain adaptation without identifiable joint distribution of features and labels.
method Formulated latent variable model with invariant and changing components, constrained domain shift to influence only changing components.
result Joint distribution of data and labels in target domain is identifiable under mild conditions.
Develops method to assess feature importance in black-box models for unconditional distribution.
problem Lack of methods to analyze feature importance in black-box models for unconditional distribution.
method Approximation method to compute feature importance curves for unconditional distribution.
result Produces sparse and faithful results, computationally efficient.
CDSSD detects sparse changes in partially observable data streams.
problem Online change detection of sparse changes in partially observable high-dimensional data streams.
method Smooth-sparse decomposition, spike-slab variational Bayesian inference, adaptive sampling via Thompson sampling.
result CDSSD effectively detects sparse changes in partially observable data streams.
MOSAIC detects change points in dynamic networks with low-rank and sparse changes.
problem Detecting change points in dynamic networks with specific structural properties.
method Eigen-decomposition-based test with screened signals and residual-based adjustment.
result MOSAIC achieves minimax-optimal detection and testing rates.
A new method detects sparse changes in high-dimensional data streams using tailored PCA projections.
problem Detecting sparse changes in high-dimensional data streams.
method Tailored PCA projections for online change detection.
result High efficiency in detecting even very sparse changes in mean, variance, and correlation.
Efficiently infers time-varying sparse MRFs with strong statistical guarantees.
problem Inference of time-varying sparse MRFs with strong statistical guarantees.
method Constrained optimization with exact ℓ0 regularization, near-linear time and memory complexity. result Sharp statistical guarantees for sparsely-changing Gaussian MRFs with as few as one sample per time.
Recent years have seen an increasing popularity of learning the sparse \emph{changes} in Markov Networks. Changes in the structure of Markov Networks reflect alternations of interactions between random variables under different regimes and provide insights into the underlying system. While each individual network struc…
In this paper, we look to address the problem of estimating the dynamic direction of arrival (DOA) of a narrowband signal impinging on a sensor array from the far field. The initial estimate is made using a Bayesian compressive sensing (BCS) framework and then tracked using a Bayesian compressed sensing Kalman filter (…
SJS model predicts label shifts in multinomial datasets.
problem Predicting label shifts in multinomial datasets.
method Sparse joint shift model for dataset shift.
result Valid predictions and class prior probabilities estimates.
For large-scale industrial processes under closed-loop control, process dynamics directly resulting from control action are typical characteristics and may show different behaviors between real faults and normal changes of operating conditions. However, conventional distributed monitoring approaches do not consider the…
Online detection of abrupt changes in high-dimensional data streams.
problem Detecting abrupt changes in high-dimensional, streaming data with multiple subspaces.
method Dynamic sparse subspace learning approach with multiple structural change-point model, Bayesian information criterion for penalty coefficients selection, and Pruned Exact Linear Time algorithm.
result Effectiveness demonstrated through simulation and real gesture data studies.
Fast robust subspace tracking in sparse data-dependent noise with near-optimal delay.
problem Robustly tracking time-varying subspaces in the presence of sparse outliers.
method Introduces a fast mini-batch robust ST solution under mild assumptions.
result Provably correct subspace tracking with near-optimal delay and same time complexity as simple PCA.
SPARTAN learns sparse interaction graphs between objects in scenes.
problem Capturing structured interactions between entities in complex settings remains challenging.
method SPARTAN is a Transformer-based world model that learns sparse, context-dependent interaction graphs through sparsity regularization on attention patterns.
result SPARTAN achieves significantly improved few-shot adaptation to dynamics changes and robustness against distractors.
We review and illustrate how the volatility smile translates into a probability distribution, the market-implied probability distribution representing believes priced in. The effects of changes in the smile are examined. Special attention is given to the effects of slope, which might appear at first counter-intuitive. …
We study the problem of learning sparse structure changes between two Markov networks P and Q. Rather than fitting two Markov networks separately to two sets of data and figuring out their differences, a recent work proposed to learn changes \emph{directly} via estimating the ratio between two Markov network models…
Deep sparse coding models resist adversarial examples.
problem Adversarial examples can fool deep learning models.
method Used deep sparse coding models to resist adversarial examples.
result Deep sparse coding models are robust to adversarial examples.
Early neural network training reveals important sub-networks and weight distributions.
problem Understanding the early phases of neural network training.
method Extensive measurements and quantitative probing of weight distribution and dataset reliance.
result Deep networks are not robust to reinitializing with random weights while maintaining signs, and weight distributions are highly non-independent.
A-DLISTA and VLISTA learn dictionaries and sparse representations under varying sensing matrices.
problem Learning dictionaries and sparse representations under varying sensing matrices.
method Augmented Dictionary Learning ISTA (A-DLISTA) and Variational Learning ISTA (VLISTA).
result VLISTA provides a probabilistic way to jointly learn the dictionary distribution and the reconstruction algorithm.
Proposes sparse local and regional counterfactual rules for robust recourses.
problem Challenges in counterfactual explanations, especially stability, synthesis, and implementation.
method Probabilistic framework using Random Forest to derive sparse local and regional counterfactual rules.
result Effective recourses derived from high-density regions, providing sparse and robust counterfactual rules.
New MIP approach for efficient change-point detection.
problem Offline multiple change-point detection in data streams.
method Mixed-integer programming (MIP) for globally optimal PWL fitting.
result Provable tighter relaxations for segment assignment variables.
New technique crafts imperceivable sparse adversarial attacks.
problem Vulnerability of neural networks to adversarial attacks.
method Proposes a black-box technique to minimize l0-distance, integrating componentwise constraints. result Adversarial examples are almost imperceivable and non-detectable.
Method trains sparse neural networks without sacrificing accuracy.
problem Training sparse neural networks limits model size.
method Updates sparse network topology during training.
result Requires fewer FLOPs to achieve accuracy.
Model predicts phytoplankton subpopulations based on environmental factors.
problem Predicting phytoplankton dynamics under changing environmental conditions.
method Sparse mixture of multivariate regressions model.
result Identifies environmental covariates influencing phytoplankton subpopulations.
Tree-based regularization improves latent variable inference from related datasets.
problem Inferring latent variables from multiple related datasets in causal systems.
method Tree-Based Regularization (TBR) for sparse changes across environments.
result TBR identifies true latent variables up to simple transformations under sparse changes.
Curriculum learning helps neural networks learn parities more efficiently.
problem Improving learning efficiency for neural networks on parity targets.
method Using a curriculum learning approach with a mixture of sparse and dense inputs.
result A 2-layer ReLU neural network can learn parities more efficiently than a fully connected network.
Paper proposes SJS model to estimate model performance under covariate and label shifts.
problem Estimating model performance when both covariates and labels shift.
method Sparse Joint Shift (SJS) model and SEES algorithm.
result SEES achieves significant shift estimation error improvements over existing approaches.
US Yield curve has recently collapsed to its most flattened level since subprime crisis and is close to the inversion. This fact has gathered attention of investors around the world and revived the discussion of proper modeling and forecasting yield curve, since changes in interest rate structure are believed to repres…
Evidential Softmax preserves multimodality in sparse probability distributions for generative models.
problem Sparse probability distributions in deep generative models make exact marginalization computationally intractable.
method Introduce ev-softmax, a sparse normalization function that preserves multimodality and can be trained with probabilistic loss functions.
result ev-softmax outperforms existing techniques in distributional accuracy and dimensionality reduction.
Paper shows statistical-computational gaps in learning sparse mixtures and robust estimation.
problem Statistical-computational gaps in learning sparse mixtures and robust estimation.
method Average-case reduction techniques, Imbalanced Sparse Gaussian Mixtures, and algorithmic change of measure.
result New hardness results for robust sparse mean estimation, semirandom planted dense subgraph, and universality principle for sparse mixture problems.
We focus on the problem of estimating the change in the dependency structures of two p-dimensional Gaussian Graphical models (GGMs). Previous studies for sparse change estimation in GGMs involve expensive and difficult non-smooth optimization. We propose a novel method, DIFFEE for estimating DIFFerential networks via…
Paper develops an efficient method for conformal prediction in sparse linear models.
problem Computing conformal prediction sets for sparse linear models is computationally infeasible.
method Numerical continuation techniques to approximate the solution path efficiently.
result The method accurately approximates conformal prediction sets for sparse linear models.
IHT improves sparse distribution learning.
problem Learning sparse discrete distributions.
method Iterative hard thresholding as a solution, with a greedy approximate projection.
result IHT achieves state of the art results for sparse distribution learning.
We address two shortcomings in online travel time estimation methods for congested urban traffic. The first shortcoming is related to the determination of the number of mixture modes, which can change dynamically, within day and from day to day. The second shortcoming is the wide-spread use of Gaussian probability dens…
New method tunes prior IP to data for flexible predictive distributions.
problem Challenges in approximate inference for large models with high parameter dependencies.
method Inducing-point representation of prior IP to approximate posterior process.
result Scalable method that tunes prior IP to data and provides accurate non-Gaussian predictive distributions.
New research challenges the idea that counterfactual explanations should be sparse.
problem Predictive multiplicity leads to multiple models giving almost equal solutions.
method Derive a general upper bound for counterfactual costs under multiplicity and compare sparse vs. data support approaches.
result Data support methods are more robust to multiplicity but have higher counterfactual costs.
Paper proposes distributed sparse multicategory discriminant analysis for classification.
problem Sparse multicategory classification with distributed data.
method Convex formulation, distributed setting, invariant discriminant subspace recovery.
result Distributed sparse multicategory linear discriminant analysis performs as good as centralized version after a few rounds of communications.
Dynamic models learn from sparse, interacting sub-systems.
problem Learning robust models for systems with local views and spatial locations.
method Abstracting the system as a collection of sparsely interacting sub-systems, each with a learned topology informed by spatial structure.
result Models are more robust to the number of available views and generalize better to novel tasks.
Robust quickest change detection method for unknown score functions.
problem Detecting changes in data streams with unknown pre- and post-change distributions.
method Selects least-favorable distributions and robustifies score-based detection algorithm.
result Demonstrates improved performance in simulations.
Paper optimizes privacy-preserving distribution estimation for sparse data.
problem Sparse distribution estimation under local differential privacy constraints.
method Compressive sensing approaches for privacy-preserving estimation.
result Significant reduction in sample complexity for approximately sparse distributions.
Improved GCNs for non-sparse graphs with low-rank filters.
problem Training and evaluation of GCNs on large non-sparse graphs is computationally expensive.
method Introduced low-rank filters and a reduced-order GCN architecture.
result Significant runtime acceleration and improved accuracy achieved.
Ranky solves SVD for large sparse matrices in distributed systems.
problem Rank problem in large sparse matrices for SVD.
method Distributed approach to solve rank problem.
result Recovers SVD with negligible error for large sparse matrices.
Paper develops sparse learning for heavy-tailed time series with locally stationary dynamics.
problem Sparse learning for high-dimensional heavy-tailed locally stationary time series.
method Additive modeling with kernel smoothing, sparsity-inducing penalized estimation.
result Prediction-error bounds and convergence rates for different sparsity structures.
BINDy uses Bayesian methods to identify nonlinear dynamics from data.
problem Learning sparse representations of complex dynamics from data.
method Bayesian treatment of dictionary learning system identification using reversible-jump Markov-chain Monte-Carlo.
result BINDy produces models that are sparse in model space rather than parameter space.