New method learns domain-invariant local feature patterns for unsupervised domain adaptation.
problem Performance degradation due to domain-shift in unsupervised domain adaptation.
method Jointly learns domain-invariant local feature patterns and holistic feature distributions.
result Superior performance on benchmark datasets compared to state-of-the-art methods.
GraLSP improves graph neural networks by incorporating local structural patterns.
problem GNNs struggle with identifying common structural patterns in graphs.
method GraLSP uses random anonymous walks to capture local graph structures and incorporates these into feature aggregation mechanisms.
result GraLSP outperforms other models in various prediction tasks on multiple datasets.
FedSLIM optimizes compact pattern models across distributed databases without sharing raw data.
problem Privacy-preserving federated descriptive analytics for data silos.
method Federated MDL-based framework using SLIM principle.
result FedSLIM variants preserve high-quality compression structure and recover globally informative patterns.
The dimer model and circle patterns are linked via combinatorial and geometric transformations.
problem Understanding the dimer model and its geometric counterpart.
method Established a correspondence between dimer models and circle patterns, using combinatorial and geometric transformations.
result The Miquel dynamics on circle patterns is governed by the octahedron recurrence.
Quantum walks blend patterns into splines when averaged.
problem Understanding the asymptotic patterns of quantum random walks.
method Averaging over quantum coins using the Haar measure.
result Patterns blend into splines, showing a unified behavior.
Proposes a new method for pattern localization in time series.
problem Locating a predefined sequence of patterns in a time series.
method Maps time series into a latent correlation space, then aligns them.
result Significant improvements over state-of-the-art methods.
ReNN integrates domain rules into neural networks for better interpretability and accuracy.
problem Lack of interpretability and need for large datasets in neural networks.
method ReNN combines local pattern detection with rule-based global synthesis, using a two-stage optimization strategy.
result ReNN improves inference accuracy and interpretability by incorporating domain rules.
PSEUDo learns patterns in multivariate time series with locality-sensitive hashing and relevance feedback.
problem Efficient pattern detection in large, multi-track sequential data with high variance and lack of ground truth.
method Query-aware locality-sensitive hashing for feature learning, sub-linear training and inference time.
result PSEUDo achieves sub-linear time efficiency for pattern modeling and comparison of 10,000 multivariate time series.
Automated discovery of diverse self-organized patterns in complex systems.
problem Automated identification of interesting spatially localized patterns in self-organizing systems.
method Intrinsically motivated machine learning algorithms (POP-IMGEPs) combined with deep auto-encoders and CPPN primitives.
result Efficiency and effectiveness of the proposed method in discovering diverse patterns compared to baselines.
Geometric perspective on unique solution in matrix completion with a deterministic pattern.
problem Identifying unique solutions in matrix completion with a specific pattern of observed entries.
method Geometric and algebraic analysis, focusing on the well-posedness condition and local stability.
result A sufficient condition for local uniqueness of matrix completion solutions, called the well-posedness condition.
The paper proposes a method to identify high-quality financial patterns using entropy.
problem Extracting reliable short-term patterns from noisy financial data.
method Entropy-assisted framework for clustering and pruning patterns.
result High-quality patterns with low local entropy and historical profitability.
Efficient binarized algorithm detects seizures from iEEG with one-shot learning.
problem Detecting seizures from iEEG data efficiently and accurately.
method Combines local binary patterns with hyperdimensional computing for end-to-end binary operations.
result Algorithm learns from one or two seizures and generalizes on 27 further seizures.
LLE produces unwanted results without regularization, which can be prevented with regularization.
problem LLE's inherent unwanted results without regularization.
method Mathematical proof and numerical examples of regularization effectiveness.
result Regularization prevents unwanted results in LLE.
New method maps high-dimensional image spaces using MCMC to reveal patterns.
problem Characterizing complex probability densities in high-dimensional image spaces.
method Attraction-Diffusion (AD) MCMC tool to map metastable regions.
result AD efficiently maps highly non-convex probability densities.
RBM models reveal how hidden unit tail behavior affects pattern reconstruction.
problem Understanding how the tail behavior of hidden units in RBMs influences pattern reconstruction.
method Identified an effective energy function for RBMs and studied its local minima.
result The ability to reconstruct patterns depends on the tail behavior of the hidden unit prior distribution.
New PCA method handles multiple datasets and detects sparse patterns robustly.
problem Handling multi-source data with sparse and outlier-robust PCA.
method Developed a regularization problem with a penalty for structured sparsity and outlier resistance.
result The method detects global and local patterns across multiple data sources robustly.
A new associative memory uses Sinkhorn divergence for efficient pattern retrieval.
problem Efficiently retrieving patterns from large datasets of weighted point clouds.
method Derived retrieval dynamics as a SHK gradient flow, discretized for a deterministic algorithm.
result Proved basin invariance, geometric convergence, and robust recovery from perturbations.
This paper explores how optimizing data access and reducing redundancy can improve machine learning algorithm performance.
problem Performance issues in machine learning algorithms due to data locality and redundancy.
method Analysis of data access patterns and computational redundancy in machine learning algorithms, identifying opportunities for reuse and experimentation.
result Initial indicative results show potential for improving performance through data access optimization and reuse of computation results.
Method predicts spatio-temporal patterns varying by region.
problem Predicting spatio-temporal processes with varying temporal patterns across regions.
method Localized spatio-temporal covariance model and sequential covariance fitting.
result Accurately predicts missing data in spatial regions over time.
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.
LGnet jointly models local and global dynamics for MTS forecasting with missing values.
problem Missing values in multivariate time series data.
method LGnet framework using memory network and adversarial training.
result LGnet effectively forecasts MTS with missing values and robust under various missing ratios.
The paper identifies patterns in language model weights used for memorizing paragraphs.
problem Locating the specific mechanisms and weights used by language models to memorize paragraphs.
method Examined gradients and attention patterns in language models to identify memorized paragraphs.
result Gradients of memorized paragraphs have a distinguishable spatial pattern, and localized attention heads are involved in paragraph memorization.
Data-target pairing is an important step towards multi-target localization for the intelligent operation of unmanned systems. Target localization plays a crucial role in numerous applications, such as search, and rescue missions, traffic management and surveillance. The objective of this paper is to present an innovati…
In the wake of recent advances in experimental methods in neuroscience, the ability to record in-vivo neuronal activity from awake animals has become feasible. The availability of such rich and detailed physiological measurements calls for the development of advanced data analysis tools, as commonly used techniques do …
Framework explains deep learning candlestick recognition.
problem Deep learning models explain candlestick patterns in a black box.
method Local search adversarial attacks to explain model reasoning.
result Model perceives candlestick patterns similarly to human traders.
Addressing the issue of SVMs parameters optimization, this study proposes an efficient memetic algorithm based on Particle Swarm Optimization algorithm (PSO) and Pattern Search (PS). In the proposed memetic algorithm, PSO is responsible for exploration of the search space and the detection of the potential regions with…
Pattern ensembling fills in missing or inaccurate trajectory data.
problem Incompleteness, missing information, and inaccuracies in geolocation data.
method Probabilistically ensemble similar trajectory patterns from the vicinity.
result Reconstructs missing or unreliable trajectory segments effectively.
Word embedding maps words into a low-dimensional continuous embedding space by exploiting the local word collocation patterns in a small context window. On the other hand, topic modeling maps documents onto a low-dimensional topic space, by utilizing the global word collocation patterns in the same document. These two …
GraphSTONE uses topic models to capture graph structures, improving GCN performance.
problem GCNs focus too much on node features and not enough on graph structures.
method GraphSTONE employs topic models of graphs to capture structural topics, which guide the aggregation of node features.
result GraphSTONE outperforms GCNs in performance, efficiency, and interpretability.
Proposes LRVM for better pattern classification of distant test instances.
problem Poor prediction for distant test instances in RVM.
method Combines RVM and k-NN to locally classify test instances.
result LRVM performs competitively compared to state-of-the-art classifiers.
Enhances GNNs to better capture local graph structures.
problem Limited expressiveness of GNNs due to star-shaped message passing.
method Extends local aggregation to subgraph patterns using GNN encoders.
result Significantly improved performance on graph ML tasks.
Deep ReLU networks with extra parameters have mostly good loss landscapes.
problem Finding good local minima in the loss landscape of deep neural networks.
method Analyzing shallow and deep ReLU networks with extra parameters on a generic dataset.
result Most activation patterns correspond to regions with no bad local minima.
The paper identifies curvature patterns in 3D homogeneous spaces.
problem Determining curvature forms in 3D locally homogeneous Lorentzian manifolds.
method Analyzing the sectional curvature operator on these manifolds.
result Identified admissible forms of the sectional curvature operator.
EPNE models evolving network patterns for better predictions.
problem Capturing evolving patterns in dynamic networks.
method EPNE models temporal network evolution using causal convolutions and a temporal objective function.
result EPNE outperforms other methods in various prediction tasks.
In the field of exploratory data mining, local structure in data can be described by patterns and discovered by mining algorithms. Although many solutions have been proposed to address the redundancy problems in pattern mining, most of them either provide succinct pattern sets or take the interests of the user into acc…
Learning rate decay helps modern neural networks by suppressing memorization and improving complex pattern learning.
problem Understanding the effectiveness of learning rate decay in training modern neural networks.
method Proposes a new explanation for lrDecay effectiveness based on network behavior and pattern complexity.
result Learning rate decay improves complex pattern learning and suppresses memorization of noisy data.
LNUCB-TA improves MAB performance by dynamically adjusting exploration rates and recognizing spatiotemporal patterns.
problem Suboptimal performance in environments with rapidly changing reward structures and static exploration rates.
method Hybrid model combining linear and nonlinear estimation, with adaptive k-NN for temporal attention.
result Significantly outperforms state-of-the-art algorithms in cumulative and mean reward, convergence, and robustness.
We derive generalized estimators for a number of spatial statistics that have been used in the analysis of spatially resolved omics data, such as Ripley's K, H and L functions, clustering index, and degree of clustering, which allow these statistics to be calculated on data modelled by arbitrary random measures (RMs). …
A new method predicts links better across various networks.
problem Adaptive link prediction for diverse network types.
method MOLI method using local information from neighbors of different distances.
result MOLI outperforms other link prediction algorithms.
This paper simplifies deep ReLU networks into local linear models for better interpretability.
problem Limited transparency and interpretability of deep neural networks, especially ReLU networks.
method Local linear representation and equivalent set of local linear models (LLMs).
result Simplified deep ReLU networks for better interpretability and diagnostics.
We find empirically a characteristic sharp peak-flat trough pattern in a large set of commodity prices. We argue that the sharp peak structure reflects an endogenous inter-market organization, and that peaks may be seen as local ``singularities'' resulting from imitation and herding. These findings impose a novel strin…
Paper uses deep learning to improve thermal-hydraulic simulations.
problem Limited credibility of thermal-hydraulic codes in real plant conditions.
method Feature Similarity Measurement (FSM) and deep learning.
result Deep learning constructs relationships between local physical features and simulation errors.
This paper proposes grid cells encode position via a conformal isometric embedding of 2D physical space.
problem Hexagonal grid firing patterns in grid cells.
method Learning a distance-preserving position embedding in neural space using a recurrent neural network.
result The conformal isometric embedding of 2D physical space into neural space explains hexagonal grid firing patterns.
Paper introduces TEP to better model treatment effect heterogeneity.
problem Personalised decision making requires evidence of treatment suitability.
method Designs TEP to represent treatment effect heterogeneity, uses local causal structure to show important variables, derives formula for unbiased CATE estimation.
result Proposed method models treatment effect heterogeneity better than existing methods.
Study shows structural variability in white matter bundles influences brain network function.
problem Understanding how structural variability in white matter bundles affects brain network function.
method Developed a method to measure local integrity of white matter bundles and used statistical approaches to analyze data.
result Variability in the local connectome correlates with variability in functional brain dynamics.
A distributed algorithm learns patterns in large images and signals.
problem High-dimensional optimization in large images and signals.
method Distributed asynchronous algorithm with locally greedy coordinate descent.
result Patterns can be learned on large scales images from the Hubble Space Telescope.
The paper proposes a new algorithm to select subsets of training data for better accuracy and explainability.
problem Tackles the challenge of balancing accuracy and explainability in pattern recognition.
method Identifies multiple subsets with simple local patterns by clustering similar instances.
result The sub-setting algorithm outperformed traditional decision trees by 15% on the international stroke dataset.
This paper enhances ML algorithms by improving data locality and reducing redundancy.
problem Improving performance of machine learning algorithms with complex data.
method Exploiting data locality and reuse in memory hierarchies of modern processors.
result Efficient implementation of machine learning algorithms can be achieved by reusing computation results.