Modes and ridges of the probability density function behind observed data are useful geometric features. Mode-seeking clustering assigns cluster labels by associating data samples with the nearest modes, and estimation of density ridges enables us to find lower-dimensional structures hidden in data. A key technical cha…
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 “mode seeking”
FlowVAT improves variational inference for multi-modal distributions.
problem Mode-seeking behavior and collapse in variational inference for complex posteriors.
method Conditional tempering approach for normalizing flow variational inference.
result FlowVAT outperforms traditional and adaptive annealing methods in multi-modal distributions, finding more modes and achieving better ELBO values.
Quick Shift is a popular mode-seeking and clustering algorithm. We present finite sample statistical consistency guarantees for Quick Shift on mode and cluster recovery under mild distributional assumptions. We then apply our results to construct a consistent modal regression algorithm.
Study guarantees convergence of mean shift mode estimation.
problem Ensuring reliable mode estimation in KDE using mean shift.
method Utilizes Łojasiewicz inequality to prove convergence rate.
result Extends convergence guarantees to biweight kernel.
A significantly faster algorithm is presented for the original kNN mode seeking procedure. It has the advantages over the well-known mean shift algorithm that it is feasible in high-dimensional vector spaces and results in uniquely, well defined modes. Moreover, without any additional computational effort it may yield …
New method trains neural samplers to sample from multi-modal distributions efficiently.
problem Mode-seeking behavior of reverse KL divergence hinders effective sampling from multi-modal target distributions.
method Minimizing reverse diffusive KL divergence along diffusion trajectories of model and target densities.
result Demonstrated enhanced sampling performance across various multi-modal distributions.
Paper tackles offline RL from mixed datasets with adaptive KL regularizer.
problem Challenges in optimizing RL and BC signals with varying action coverage and multiple action modes.
method Adaptively weighted reverse KL divergence regularizer based on TD3 algorithm.
result Empirically outperforms existing offline RL algorithms in MuJoCo locomotion tasks.
CT compares two distributions using Bayes' theorem and chain rule.
problem Measuring the difference between two probability distributions.
method Conditional transport (CT) using chain rule and Bayes' theorem.
result CT strikes a good balance between mode-covering and mode-seeking behaviors.
Paper unifies subspace identification and DMD for dynamical systems.
problem Estimating dynamical models from data.
method Unified optimization and regression problems for SID and DMD.
result Proves equivalence of SID and DMD for optimal model construction.
In this paper, we propose a new fuzzy clustering algorithm based on the mode-seeking framework. Given a dataset in , we define regions of high density that we call cluster cores. We then consider a random walk on a neighborhood graph built on top of our data points which is designed to be attracted by hig…
CADD improves generative quality by augmenting discrete diffusion with continuous latent space.
problem Loss of semantic information between denoising steps in discrete diffusion models.
method Introduces a framework that augments discrete state space with a continuous latent space, allowing for graded, informative masked tokens.
result CADD improves generative quality across text generation, image synthesis, and code modeling.
A new method reduces model complexity in DMD using LARS.
problem Building accurate reduced-order models from data.
method Least Angle Regression (LARS) for Dynamic Mode Decomposition (DMD).
result LARS4DMD produces comparable performance to DMDSP with less complexity.
MeRL learns from sparse, underspecified rewards by discounting spurious trajectories.
problem Learning from binary success-failure feedback with little context.
method MeRL uses KL divergence to collect diverse successful trajectories and optimize an auxiliary reward function.
result MeRL outperforms alternative reward learning techniques and achieves state-of-the-art performance.
Develops an MS-inspired algorithm for regression mode finding and space partitioning.
problem Finding local modes of regression functions and partitioning input space.
method Mean-shift-inspired algorithm for iterative gradient ascent.
result Proves convergence and rates of convergence for estimated local modes.
Jeffreys Flow improves robustness of Boltzmann generators for rare event sampling.
problem Rare events and metastable trapping in sampling physical systems with rough energy landscapes.
method Introduces Jeffreys Flow, a robust generative framework using Parallel Tempering distillation and symmetric Jeffreys divergence to mitigate mode collapse and improve mode coverage.
result Minimizing Jeffreys divergence suppresses mode collapse and corrects inaccuracies in multi-modal distributions.
EM Distillation simplifies diffusion models to one-step generators.
problem Efficient sampling from complex diffusion models with minimal loss of quality.
method EM Distillation, a maximum likelihood approach based on Expectation-Maximization.
result EM Distillation outperforms existing one-step generative methods in FID scores.
End-to-end learnable Gaussian mixture priors improve diffusion models' exploration and expressiveness.
problem Challenges in diffusion models when priors differ from target distributions.
method End-to-end learnable Gaussian mixture priors (GMPs) with iterative refinement.
result Significant performance improvements across various benchmark problems.
A new method improves posterior approximation for complex distributions.
problem Difficulty in capturing multimodal and heavy-tailed posteriors with standard normalizing flows.
method StiCTAF: stick-breaking mixture base with component-wise tail adaptation.
result Improved tail recovery and better mode coverage compared to benchmarks.
Mean shift clustering finds the modes of the data probability density by identifying the zero points of the density gradient. Since it does not require to fix the number of clusters in advance, the mean shift has been a popular clustering algorithm in various application fields. A typical implementation of the mean shi…
Encoder-decoder GANs architectures (e.g., BiGAN and ALI) seek to add an inference mechanism to the GANs setup, consisting of a small encoder deep net that maps data-points to their succinct encodings. The intuition is that being forced to train an encoder alongside the usual generator forces the system to learn meaning…
Given i.i.d samples from some unknown continuous density on hyper-rectangle , we attempt to learn a piecewise constant function that approximates this underlying density non-parametrically. Our density estimate is defined on a binary split of and built up sequentially according to discrepancy crite…
HypeGBMS clusters data in hyperbolic space, overcoming Euclidean limitations.
problem Clustering in hierarchical or tree-like datasets in curved spaces.
method Hyperbolic Gaussian Blurring Mean Shift with Möbius-weighted means.
result HypeGBMS effectively captures latent hierarchies in non-Euclidean data.
Applying probabilistic models to reinforcement learning (RL) enables the application of powerful optimisation tools such as variational inference to RL. However, existing inference frameworks and their algorithms pose significant challenges for learning optimal policies, e.g., the absence of mode capturing behaviour in…
A feature-weighted mean shift algorithm improves clustering in high-dimensional data.
problem Clustering high-dimensional data with traditional mean shift algorithms.
method Feature-weighted mean shift algorithm.
result The algorithm outperforms conventional mean shift and preserves computational simplicity.
Flow AIS Bootstrap improves flow training by generating samples in hard-to-reach regions.
problem Training flows with high variance and mode-seeking behavior.
method Augment flows with AIS and minimize -divergence with .
result FAB learns Boltzmann distribution of alanine dipeptide without MD samples.
Bootstrap Your Flowcs.LG
FAB combines flows with AIS to approximate complex distributions.
problem Challenges in flow-based methods, especially on complex targets.
method Combines flows with AIS, using α-divergence for training.
result FAB produces accurate approximations to complex distributions.
MMAML adapts quickly to multimodal tasks with task-aware modulation.
problem Limitation of common initialization in MAML for diverse task distributions.
method Augment MAML with task-aware modulation to adapt to multimodal task distributions.
result MMAML improves adaptation efficiency on multimodal few-shot learning tasks.
How periodic surfaces bendmath.DG
Periodic surfaces have a limited number of bending modes, equal to their membrane modes.
problem Understanding the limitations of bending modes in periodic surfaces.
method Analyzing deformation modes of periodic, piecewise smooth, simply connected surfaces.
result Effective membrane modes and bending modes are orthogonal, limiting the total number of modes to 3.
Sparse-mode DMD disambiguates local and global modes in spatiotemporal data.
problem Disambiguating local and global modes in spatiotemporal data.
method Sparse-mode DMD with sparsity-promoting regularization.
result Explicitly constructs discrete and continuous spectra.
Motivated by advantages of current-mode design, this brief contribution explores the implementation of weight matrices in neuromemristive systems via current-mode memristor crossbar circuits. After deriving theoretical results for the range and distribution of weights in the current-mode design, it is shown that any we…
Curiosity-driven recommendations improve personalized learning efficiency and enjoyment.
problem Improving personalized learning through adaptive strategies.
method Curiosity-driven reinforcement learning with actor-critic neural networks.
result Demonstrated through numeric analyses, the proposed method enhances learning efficiency and enjoyment.
Log-density gradient estimation is a fundamental statistical problem and possesses various practical applications such as clustering and measuring non-Gaussianity. A naive two-step approach of first estimating the density and then taking its log-gradient is unreliable because an accurate density estimate does not neces…
The paper develops methods to infer modes of linear systems from noisy data.
problem Detecting oscillations in power flow in AC electrical networks.
method Develops methods to infer modes (real or complex) from observations of linear systems forced by Gaussian noise.
result Inference of damping rates, frequencies, and mode shapes for real and complex modes.
Characterizes neutral deformation modes of minimal surfaces.
problem Understanding the energy content of deformation modes of minimal surfaces.
method Analyzes the energy content of stretching, drilling, and bending modes of minimal surfaces.
result All isometries of a minimal surface are globally neutral and give rise to soft elasticity.
TAEs discover slow modes but mix them with max variance modes.
problem Discovering slow modes in dynamical systems.
method Theoretical and numerical analysis of TAEs.
result TAEs learn a mixture of slow and max variance modes.
Annealing in variational inference mitigates mode collapse: A theoretical study on Gaussian mixturesstat.ML
Mathematical analysis shows annealing prevents mode collapse in Gaussian mixtures.
problem Mode collapse in variational inference for multimodal distributions.
method Analyzed annealing strategies for Gaussian mixtures, derived formulas, and tested on neural networks.
result Appropriately chosen annealing schemes can robustly prevent mode collapse.
Parsimonious Dynamic Mode Decomposition selects sparse modes robustly.
problem Manual tuning of sparsity parameters in traditional DMD.
method Time-delay embedding and Orthogonal Matching Pursuit.
result Autonomously determines optimally sparse subset of modes.
Sparse Bayesian Optimization (SEBO) finds interpretable configurations.
problem Optimizing black-box functions for recommendation systems while maintaining interpretability.
method Regularization-based approaches, including a differentiable relaxation for regularization, and a hyperparameter-free method SEBO.
result SEBO efficiently optimizes for sparsity without hyperparameters.
Improved sampling via learned diffusions using variational losses.
problem Sampling from target distributions without direct access to samples.
method Generalized Schrödinger bridge problem, variational formulation, gradient-based optimization.
result Proposed log-variance loss leads to improved performance.
The limits of interpretability in multiple linear regressioncond-mat.dis-nn
Interpretable machine-learning models can be unstable under multicollinearity, leading to oscillatory weights that do not reflect meaningful contributions.
problem Interpretable machine-learning models can be unstable under multicollinearity.
method Theoretical analysis of eigenmodes of the feature correlation matrix.
result Small-eigenvalue modes associated with multicollinearity amplify fluctuations in the weights and generate oscillatory patterns that do not necessarily reflect meaningful contributions.
Geodesics connect model modes in neural network loss landscapes.
problem Connecting modes in neural network loss landscapes.
method Reframed mode connectivity in Information Geometry, hypothesized geodesics as mode-connecting paths, proposed algorithm to approximate geodesics.
result Geodesics achieve mode connectivity in neural networks.
A new, efficient -modes algorithm improves clustering of categorical data.
problem Clustering categorical data using existing methods like -means is inefficient.
method Developed a novel -modes algorithm called OTQT, which improves on existing methods.
result OTQT finds more accurate clusters per iteration and is faster overall.
Cryptocurrency traders increase stock risk-seeking behavior.
problem Understanding the motivations behind cryptocurrency trading.
method Individual-level brokerage data analysis of stock trading behavior.
result Cryptocurrency traders increase risk-seeking behavior in stocks when engaging in cryptocurrency trading.
Multimodal clustering is an unsupervised technique for mining interesting patterns in -adic binary relations or -mode networks. Among different types of such generalized patterns one can find biclusters and formal concepts (maximal bicliques) for 2-mode case, triclusters and triconcepts for 3-mode case, closed $n…
Paper introduces a simulator-free approach to reinforcement learning policy distillation.
problem Learning multiplicity of cases corresponding to a given action in reinforcement learning.
method Generative adversarial approach to find multiple exemplars for each output class.
result Improves over state-of-the-art on data-free learning of student networks.
EDLP samples flat modes in discrete spaces using entropy.
problem Sampling flat modes in discrete spaces is challenging.
method EDLP uses a continuous auxiliary variable and local entropy to guide sampling.
result EDLP consistently outperforms traditional methods in various tasks.
Proposes a Gaussian process for Koopman mode decomposition.
problem Estimating Koopman mode decomposition quantities and latent variables.
method Unsupervised Gaussian process for simultaneous estimation.
result Efficient parameter estimation through low-rank approximations.
A new mathematical framework for multimodal learning.
problem Linking different data modalities for better understanding.
method Interpreting contrastive learning as optimizing encoders for conditional probability distributions.
result Novel probabilistic loss functions and metrics for alignment in latent space.