Proves existence of circle patterns on surfaces with cusps.
problem Existence of circle patterns with prescribed angles on surfaces with cusps.
method Introduced combinatorial Ricci and Calabi flows to prove longtime existence and convergence.
result Existence of generalized circle patterns with prescribed angles on surfaces with cusps.
Study of knots with generalized Mazur patterns and their invariants.
problem Understanding the invariants and properties of knots with generalized Mazur patterns.
method Computational analysis of τ and ε invariants for n-twisted satellites. result None of the n-twisted patterns from the family act surjectively on the smooth or rational concordance group. Generative model attacks CNN on MNIST by subtly replacing input patterns.
problem Adversarial attacks on neural networks.
method Generative model that replaces input patterns with generated ones.
result Demonstrated effectiveness on MNIST dataset.
This paper formalizes a latent variable inference problem we call {\em supervised pattern discovery}, the goal of which is to find sets of observations that belong to a single ``pattern.'' We discuss two versions of the problem and prove uniform risk bounds for both. In the first version, collections of patterns can be…
Paper extends circle pattern theory to obtuse angles.
problem Circle patterns with obtuse angles not previously covered.
method Using topological degree theory, extends Koebe-Andreev-Thurston Theorem.
result Generalized Andreev's Theorem for obtuse dihedral angles.
This paper investigates circle patterns with obtuse exterior intersection angles on surfaces of finite topological type. We characterise the images of the curvature maps and establish several equivalent conditions regarding long time behaviors of Chow-Luo's combinatorial Ricci flows for these patterns. As consequences,…
For using neural networks in safety critical domains, it is important to know if a decision made by a neural network is supported by prior similarities in training. We propose runtime neuron activation pattern monitoring - after the standard training process, one creates a monitor by feeding the training data to the ne…
Thurston's Circle Pattern Theorem studies existence and rigidity of circle patterns of a given combinatorial type and the given non-obtuse exterior intersection angles. Using topological degree theory, variational principle, Teichmuller theory, and Sard's Theorem, this paper generalizes Circle Pattern Theorem to the ca…
A ``hyperideal circle pattern'' in S2 is a finite family of oriented circles, similar to the ``usual'' circle patterns but such that the closed disks bounded by the circles do not cover the whole sphere. Hyperideal circle patterns are directly related to hyperideal hyperbolic polyhedra, and also to circle packings. …
An important problem in geostatistics is to build models of the subsurface of the Earth given physical measurements at sparse spatial locations. Typically, this is done using spatial interpolation methods or by reproducing patterns from a reference image. However, these algorithms fail to produce realistic patterns and…
Video sequences contain rich dynamic patterns, such as dynamic texture patterns that exhibit stationarity in the temporal domain, and action patterns that are non-stationary in either spatial or temporal domain. We show that a spatial-temporal generative ConvNet can be used to model and synthesize dynamic patterns. The…
Unified framework for pattern recovery in penalized and thresholded estimation.
problem Pattern recovery in penalized and thresholded estimation methods.
method Defining a novel pattern notion based on subdifferentials, introducing accessibility and noiseless recovery conditions.
result Unified and extended conditions for pattern recovery in a broad class of penalized estimators.
The paper uses pattern similarity-based methods for mid-term electricity demand forecasting.
problem Forecasting monthly electricity demand with seasonal patterns.
method Pattern similarity-based machine learning models (nearest neighbor, fuzzy neighborhood, kernel regression, GRNN).
result The proposed models outperform classical and state-of-the-art models in accuracy and simplicity.
CDPA identifies common and distinctive patterns in high-dimensional datasets.
problem Existing methods fail to capture the common pattern between coefficient matrices of shared latent factors.
method Proposes CDPA, an unsupervised learning method that incorporates both common and distinctive patterns of coefficient matrices.
result CDPA provides better characterization of common and distinctive patterns in high-dimensional datasets.
A cornerstone of human statistical learning is the ability to extract temporal regularities / patterns from random sequences. Here we present a method of computing pattern time statistics with generating functions for first-order Markov trials and independent Bernoulli trials. We show that the pattern time statistics c…
Discriminative pattern mining is an essential task of data mining. This task aims to discover patterns which occur more frequently in a class than other classes in a class-labeled dataset. This type of patterns is valuable in various domains such as bioinformatics, data classification. In this paper, we propose a novel…
New patterns on spheres and hyperbolic planes described by integrable systems.
problem Integrable systems and variational principles for spherical and hyperbolic ring patterns.
method Discrete integrable system, variational principles, elliptic dilogarithm function.
result Existence and uniqueness of ring patterns for Dirichlet and Neumann problems.
TFPS improves time series forecasting by learning pattern-specific experts.
problem Challenges in forecasting time series data with varying patterns across segments.
method Dual-domain encoder, subspace clustering, pattern-specific experts.
result Significantly improved forecasting accuracy, especially in long-term forecasting.
Pattern sampling has been proposed as a potential solution to the infamous pattern explosion. Instead of enumerating all patterns that satisfy the constraints, individual patterns are sampled proportional to a given quality measure. Several sampling algorithms have been proposed, but each of them has its limitations wh…
Max-pooling architectures are theoretically analyzed and shown to be globally optimized and generalize well.
problem Theoretical understanding and optimization of max-pooling in deep learning architectures.
method Theoretical analysis of a convolutional max-pooling architecture, focusing on a pattern detection problem.
result Max-pooling architectures can be globally optimized and generalize well, even for highly over-parameterized models.
Paper generalizes Andreev's theorem with obtuse angles.
problem Characterizing hyperbolic polyhedra with obtuse angles.
method Established discrete analog of weak solution/regularity theory.
result Generalized Andreev's Theorem to include obtuse angles.
Deep neural networks' loss surfaces contain every low-dimensional pattern.
problem Finding arbitrary low-dimensional patterns in neural network loss surfaces.
method Empirical and theoretical analysis of loss landscapes of deep neural networks.
result Deep universal approximators exhibit a property where arbitrary smooth patterns exist in their loss surfaces.
FSR efficiently discovers significant patterns with few resampled datasets.
problem Mining significant patterns in transactional data, especially subgroups.
method FSR uses resampling to bound the supremum deviation of quality statistics, providing rigorous guarantees on false discoveries.
result FSR effectively discovers significant subgroups with a small number of resampled datasets.
Study handles in 3D shapes, applies to material patterns.
problem Understanding 3D shapes through handlebody decompositions.
method Introduced handlebody decompositions, showed stability, applied to materials.
result Stable equivalence of handlebody decompositions in 3-manifolds.
We prove that for any winding number m>0 pattern P and winding number −m pattern Q, there exist knots K such that the minimal genus of a cobordism between P(K) and Q(K) is arbitrarily large. This answers a question posed by Cochran-Harvey [CH17] and generalizes a result of Kim-Livingston [KL05].
Market Mill is a complex dependence pattern leading to nonlinear correlations and predictability in intraday dynamics of stock prices. The present paper puts together previous efforts to build a dynamical model reflecting the market mill asymmetries. We show that certain properties of the conditional dynamics at a sing…
Safe Pattern Pruning reduces pattern explosion in predictive pattern mining.
problem Exponential growth of patterns in structured data.
method Safe Pattern Pruning (SPP) method.
result Effective model building in practical data analysis.
Study forecasts monthly electricity demand using pattern similarity-based methods.
problem Forecasting monthly electricity demand accurately.
method Pattern similarity-based forecasting methods (PSFMs) including k-NN, fuzzy, kernel regression, and GRNN.
result Ensemble models outperform individual PSFMs in forecasting accuracy.
Unique circle patterns on spheres found for spherical conical metrics.
problem Non-uniqueness in circle packing for spherical metrics.
method Prescribed geodesic total curvature instead of cone angles.
result Unique existence of circle patterns for spherical conical metrics.
A central challenge faced by memory systems is the robust retrieval of a stored pattern in the presence of interference due to other stored patterns and noise. A theoretically well-founded solution to robust retrieval is given by attractor dynamics, which iteratively clean up patterns during recall. However, incorporat…
The paper studies how grid cell patterns emerge in neural networks.
problem Understanding how grid cells in the brain form hexagonal firing patterns.
method Training recurrent neural networks with conformal normalization of velocity inputs.
result Conformal normalization is crucial for the emergence of hexagonal grid patterns in neural networks.
The understanding of geographical reality is a process of data representation and pattern discovery. Former studies mainly adopted continuous-field models to represent spatial variables and to investigate the underlying spatial continuity/heterogeneity in the regular spatial domain. In this article, we introduce a more…
Generative model improves EMG pattern recognition accuracy.
problem Stochastic characteristics of EMG signals not fully considered in existing classification methods.
method Scale mixture-based stochastic generative model with variational Bayesian learning.
result Proposed method outperforms conventional classifiers in EMG pattern recognition.
Convolutional networks struggle with repeating patterns in ECGs.
problem Modeling repeating patterns in electrocardiogram signals.
method Demonstrated through ECG examples, highlighting systemic issues in deep learning.
result Counterintuitive effects on generalization in deep networks.
New knots not slice in rational 4-balls found.
problem Identifying knots not slice in rational homology 4-balls.
method Using generalized Mazur patterns and immersed Heegaard Floer homology.
result Infinitely many examples of pattern knots P not slice in any rational homology 4-ball.
Scales gradual pattern discovery from imprecise data.
problem Managing large collections of gradual patterns from imprecise data.
method Introduces gradualness thresholds and considers attribute value distribution.
result Eliminates noise patterns, showing a smaller set of meaningful patterns.
Neural networks can detect weak patterns hidden in noise.
problem Detecting weak patterns in noisy data.
method Developed a three-layer Sejnowski machine with redundant representation, showing patterns can be stored and retrieved efficiently.
result Neural networks can retrieve information with intensity O(1) even in the presence of noise O(\sqrt{N}) in the large N limit.
BN^2MF identifies unknown exposure patterns in environmental mixtures.
problem Identifying unknown exposure patterns in environmental mixtures.
method Bayesian non-parametric non-negative matrix factorization (BN^2MF) with non-negative continuous priors and a non-parametric sparse prior.
result Estimates patterns of chemical exposures without specifying the number of patterns.
RestoreAI predicts landmine risk from patterns, improving clearance efficiency.
problem Predicting landmine risk from spatial patterns to enhance clearance efficiency.
method RestoreAI uses landmine patterns for risk prediction, implementing three deminers: linear, curved, and Bayesian.
result RestoreAI significantly boosts clearance efficiency, achieving a 14.37 percentage point increase in cleared landmines per timestep.
Proposes a new voice conversion model that preserves pitch patterns.
problem Preserving pitch patterns while changing speaker identity.
method Variational-autoencoder-based model with an auxiliary network.
result Ensures the conversion result correctly reflects specified F0/timbre information.
Study knot groups from disc patterns in 3D space.
problem Understanding groups generated by reflections in planar patterns.
method Construct and study representation spaces of holonomy groups of hyperbolic 3-manifolds.
result Visualizations suggest conjectures and support algebraic calculations.
Electroencephalography (EEG) is a method to record the electrical signals in the brain. Recognizing the EEG patterns in the sleeping brain gives insights into the understanding of sleeping disorders. The dataset under consideration contains EEG data points associated with various physiological conditions. This study at…
The paper develops methods to create private synthetic spatial point patterns.
problem Generating private synthetic spatial point patterns.
method Developed differentially private Poisson and Cox point synthesizers.
result The synthesizers effectively maintain privacy and utility of synthetic data.
Two approaches detect EV charging patterns at stations.
problem Identify charging patterns at electric vehicle charging stations.
method Two approaches: rule-based and hierarchical clustering.
result Hierarchical clustering revealed unexpected charging patterns.
Fine-tunes GNNs by preserving generative patterns to improve transferability.
problem Vanilla fine-tuning fails due to structural divergence between pre-training and downstream graphs.
method G-Tuning, which reconstructs the generative patterns of the downstream graph using graphon bases.
result G-Tuning achieves an average improvement of 0.5% and 2.6% on in-domain and out-of-domain transfer learning experiments.
This report works out the details of a closed-form, fully Bayesian, multiclass, openset, generative pattern classifier using multivariate Gaussian likelihoods, with conjugate priors. The generative model has a common within-class covariance, which is proportional to the between-class covariance in the conjugate prior. …
FEALM learns features for better nonlinear DR of hidden patterns.
problem DR misses important patterns on distorted manifolds.
method FEALM generates optimized projections using an optimization algorithm and neighbor-shape dissimilarity.
result FEALM captures important patterns on hidden manifolds.
Extends quadratic loss for SVM and deep learning to improve pattern correlation.
problem Improving generalization in supervised binary classification and regression tasks.
method Extends quadratic loss, restarts from problem (8) in [3], proposes new algorithms, uses multiple kernel learning.
result Comparable results with standard losses and parameterized quadratic loss.