Improved deep learning for one-shot and open-set classification using alignment-based matching.
problem Limited data for one-shot classification and open-set recognition.
method Aligns images to reference images for classification, learns alignment mechanism.
result Significantly improved classification accuracy (e.g., 1.4% error rate in Omniglot, 46.5% in MiniImageNet).
This paper improves cross-domain learning using random forests for manifold alignment.
problem Improving cross-domain learning and feature integration.
method Semi-supervised manifold alignment using random forest proximities.
result Random forest proximities enhance downstream classification accuracy.
GCNs' performance linked to feature, graph, and ground truth alignment.
problem Improving GCNs' classification performance.
method Subspace alignment measure (SAM) based on Frobenius norm of chordal distances.
result SAM quantifies the alignment between features, graph, and ground truth.
Gradient-HA aligns fMRI data faster and more accurately.
problem Aligning fMRI data from multiple subjects efficiently and accurately.
method Gradient-HA uses ICA and SGA to solve alignment issues.
result Gradient-HA outperforms other methods in big data fMRI analysis.
kaLDA improves LDA using kernel alignment for better classification.
problem Improving Linear Discriminant Analysis for better classification performance.
method Inspired by kernel alignment, kaLDA finds a subspace to maximize alignment between transformed data and class kernels.
result kaLDA performs well on both single-label and multi-label datasets.
SGD's training dynamics align with Hessian and gradient spectra in high-dimensional classification tasks.
problem Understanding the spectra of Hessian and gradient matrices in high-dimensional classification tasks.
method Rigorous analysis of SGD dynamics and spectra of Hessian and gradient matrices.
result SGD trajectory and emergent outlier eigenspaces align with a common low-dimensional subspace in multi-class high-dimensional mixtures and neural networks.
Study improves understanding and performance of FA learning rules in neural networks.
problem Lack of theoretical understanding and limited applications of Feedback Alignment (FA) methods.
method Introduces a unified framework linking synaptic weight changes to implicit regularization, providing convergence conditions and empirical evidence.
result Better alignment can enhance FA performance on complex multi-class tasks.
Two semi-supervised manifold alignment methods improve cross-domain classification.
problem Aligning data from multiple sources for better analysis.
method SPUD and MASH methods using graph integration and diffusion.
result SPUD and MASH methods outperform existing methods in cross-domain classification.
New findings link causal models to strategic classification, improving robustness and alignment.
problem Strategic adaptation by users in classification tasks.
method Causal models to bound worst-case out-of-distribution risk.
result Causal classification optimizes classification error after adaptation under certain noise conditions.
Alignment of neural network representations is influenced by SNR and sample size.
problem Understanding how neural network representations align across different conditions.
method Controlled training of neural networks on perturbed datasets, analyzing alignment and generalization.
result Alignment varies monotonically with SNR but non-monotonically with sample size, with minimal alignment near the interpolation threshold.
Traditional pairwise sequence alignment is based on matching individual samples from two sequences, under time monotonicity constraints. However, in many application settings matching subsequences (segments) instead of individual samples may bring in additional robustness to noise or local non-causal perturbations. Thi…
MetFA aligns source and target domains for cross-device image classification.
problem Learning discriminative class boundaries across different domains.
method Distance metric guided feature alignment (MetFA) for domain-invariant and discriminative feature extraction.
result MetFA outperforms state-of-the-art methods in cross-device image classification.
TTW aligns time-series faster and more accurately than existing methods.
problem Efficiently aligning multiple time-series signals with varying lengths.
method TTW uses a sinc convolutional kernel and gradient-based optimization for linear time and sequence complexity.
result TTW outperforms existing methods in time-series averaging and classification tasks.
A new framework improves ASR alignment accuracy via optimal transport.
problem Peaky behavior and alignment inaccuracies in E2E ASR models.
method Differentiable alignment framework based on 1D optimal transport.
result Significant improvement in ASR alignment performance compared to CTC.
A new method reduces preference distortion in LLM alignment.
problem Vulnerability of traditional LLM alignment methods to human preference heterogeneity.
method Sign Estimator: A simple, provably consistent, and efficient estimator using binary classification loss.
result Substantially reduces preference distortion over a panel of simulated personas.
DeepFRC learns both alignment and classification of functional data in one model.
problem Phase variability in functional data obscures underlying patterns and degrades model performance.
method End-to-end deep learning framework that combines diffeomorphic warping functions and a classifier.
result DeepFRC outperforms state-of-the-art methods in both alignment quality and classification accuracy.
Gradient descent aligns weights in deep linear networks for binary classification.
problem Aligning weights in deep linear networks for binary classification.
method Gradient descent applied to strictly decreasing loss functions.
result Normalized weight matrices align across layers, converging to the maximum margin solution.
Classifies surfaces supporting alignable nets with geodesic and conjugate properties.
problem Classifying surfaces with specific geometric properties.
method Cartan's theory of moving frames, coordinate-free classification, explicit immersion formulas.
result Two classes of alignable Voss surfaces, each with two two-parameter families, including one with an isothermal-conjugate geodesic net.
Recent work on learning multilingual word representations usually relies on the use of word-level alignements (e.g. infered with the help of GIZA++) between translated sentences, in order to align the word embeddings in different languages. In this workshop paper, we investigate an autoencoder model for learning multil…
Paper proposes a new approach to improve EEG-based BCIs.
problem Improving learning performance for new subjects with minimal data.
method Aligns EEG trials in Euclidean space to make them more similar.
result Outperforms state-of-the-art approaches in offline and online experiments.
Paper tackles ASC with coarse-to-fine task transfer for AT-level sentiment classification.
problem Small AT-level corpora and limited data for fine-grained AT task.
method Coarse-to-fine task transfer using MGAN with Coarse2Fine attention and contrastive feature alignment.
result MGAN improves ASC performance on AT-level sentiment classification.
The paper examines how spike strengths and alignments affect overfitting in linear regression models.
problem The impact of spike strengths and alignments on overfitting in linear regression models.
method Characterization of generalization error through exact expressions and analysis of spike strengths, aspect ratio, and target alignment.
result Increasing spike strength can lead to catastrophic overfitting before benign overfitting, especially in well-specified aligned problems.
New model learns graph features for classification.
problem Graph classification with structural information loss.
method Transform graphs into vertex grids, apply vertex convolution.
result Model preserves structural information on local vertices.
FJS method improves multinomial classification accuracy.
problem Improving multinomial classification accuracy under dataset shift.
method Derive FJS representation and propose alternative methods.
result Factorizable joint shift is not fully identifiable without additional assumptions.
Develops BASGCN for graph classification with improved feature learning.
problem Graph classification with information loss and imprecise representation.
method Transforms graphs into grid structures and defines a new spatial graph convolution operation.
result Reduces information loss and improves feature representation compared to existing models.
Algorithm classifies five-dimensional spacetimes, generalizing Karlhede's for four dimensions.
problem Classifying five-dimensional spacetimes for general relativity.
method Introduces an algorithm to determine spacetime equivalence using alignment classification of the Weyl tensor.
result Illustrates the algorithm with three examples and discusses its applications.
Aligns uncertainty predictions for domain adaptation using pre-trained deep networks.
problem Domain adaptation with unlabelled target data.
method Adversarial learning to align uncertainty predictions between source and target domains.
result Class prediction uncertainty on target domain matches source domain.
Study Einstein metrics on aligned homogeneous spaces with maximal third Betti number.
problem Existence and classification of Einstein metrics on specific homogeneous spaces.
method Analysis of isotropy representation and computation of Ricci curvature.
result Computation of Ricci curvature formulas for aligned homogeneous spaces.
We propose a principle and loss functions for efficient single-class classification.
problem Efficient binary classification for specific classes in high-dimensional data.
method Define Single Logit Classification (SLC) task, propose Principle of Logit Separation, and design loss functions.
result Loss functions aligned with the Principle of Logit Separation improve SLC accuracy by 20%.
CUDA CTDR tackles unsupervised domain adaptation without domain alignment.
problem Lack of direct methods for unlabeled target domain classification.
method Jointly learns CTDR on source and target distributions using contradistinguish loss and supervised loss.
result CUDA CTDR achieves state-of-the-art results on various domain adaptation datasets.
Interpretable semantic textual similarity (iSTS) task adds a crucial explanatory layer to pairwise sentence similarity. We address various components of this task: chunk level semantic alignment along with assignment of similarity type and score for aligned chunks with a novel system presented in this paper. We propose…
This paper improves MI-based BCIs by applying transfer learning across all components.
problem Reducing calibration effort for new subjects in MI-based BCIs.
method Proposes TL in spatial filtering, feature engineering, and classification blocks, and adds data alignment.
result Integrating data alignment and sophisticated TL significantly improves classification performance and reduces calibration effort.
Pairwise ranking aligns subjective clinical evaluations with objective indicators.
problem Aligning subjective clinical evaluations with objective indicators for improved diagnosis.
method Pairwise ranking methods to align subjective evaluations with objective indicators.
result The resulting score improves classification accuracy and provides a nuanced severity assessment.
A new semi-supervised learning method using label gradients.
problem Improve accuracy in semi-supervised learning with limited labeled data.
method Impute labels for unlabeled data using a distance metric based on model gradients, then optimize these imputed labels.
result Demonstrates state-of-the-art accuracy in semi-supervised CIFAR-10 classification.
This paper uses MIO to select features for kernel SVM classification.
problem Feature selection for kernel SVM classification.
method Mixed-integer optimization (MIO) for feature subset selection.
result The MIO approach can often outperform linear-SVM-based methods in prediction performance.
Space-efficient feature maps improve string alignment kernel scalability.
problem String alignment kernels scale poorly with quadratic complexity, limiting large-scale applications.
method Presented SFMEDM, a space-efficient feature map for edit distance with moves using metric embedding and random Fourier features.
result Demonstrated superior performance of SFMEDM in prediction accuracy, scalability, and computation efficiency.
This paper improves ASR performance by aligning frames more accurately.
problem Disagreement between teacher-student models in frame-level alignment.
method Introduces self-knowledge distillation (SKD) to guide frame-level alignment.
result Improves both resource efficiency and performance in ASR.
We introduce BilBOWA (Bilingual Bag-of-Words without Alignments), a simple and computationally-efficient model for learning bilingual distributed representations of words which can scale to large monolingual datasets and does not require word-aligned parallel training data. Instead it trains directly on monolingual dat…
Proposes COALA method for learning audio representations aligned with tags.
problem Lack of annotated data for high-performance audio representation learning.
method Aligns latent representations of audio and tags using a contrastive loss.
result Audio embedding model captures both acoustic and semantic characteristics.
CoDA Nets improve interpretability in neural networks.
problem Improving interpretability in neural networks.
method Dynamic Alignment Units (DAUs) for input-dependent linear transformations.
result CoDA Nets achieve on par results with ResNet and VGG models on complex datasets.
A new method for drone-based geo-localization using style and spatial alignment.
problem Geo-localization of drone-view images with satellite-view images using pre-annotated GPS tags.
method Orientation-based method to align patterns, new branch to extract aligned partial features, style alignment strategy.
result The proposed method outperforms state-of-the-art alternatives in geo-localization accuracy.
Proposes a method for weakly-supervised object localization to improve few-shot learning.
problem Challenges of few-shot learning, especially with fine-grained categories.
method Introduces a Self-Attention Based Complementary Module (SAC Module) for weakly-supervised object localization.
result Significantly outperforms state-of-the-art methods on benchmark datasets, especially for fine-grained few-shot tasks.
Study assesses linear classifiers for virus genotyping and subtyping.
problem Challenges in classifying viral sequences, especially in alignment-free methods.
method Comprehensive evaluation of linear classifiers on HCV genomes, varying parameters and sequence lengths.
result Several classifiers perform well under specific conditions, providing robust assessment.
A novel method for comparing graphs of different sizes using Wasserstein distance.
problem Comparing non-aligned graphs of varying sizes.
method Optimal transport in graph comparison framework, solving a one-to-many assignment problem.
result Significant improvements in graph alignment and classification tasks.
Proposes methods to recover labels from shuffled networks using graph averages.
problem Recovering labels from a shuffled network using graph averages.
method Cluster networks into classes, then match the new graph to cluster-averages, minimizing the graph matching objective function.
result Higher fidelity matching performance when clustering networks into different classes.
A new topology design improves zero-shot classification performance in contrastive learning.
problem Improving zero-shot classification performance in contrastive visual-textual alignment.
method Proposed an alternative topology design using multiple class tokens and an oblique manifold with negative inner product.
result Improves zero-shot classification performance by an average of 6.1%.
Study optimizes tree-based models for better alignment of predicted scores and actual probabilities.
problem Traditional calibration metrics fail to align predicted scores with actual probabilities when score distributions deviate from the underlying data.
method Optimizes tree-based models (Random Forest, XGBoost) using Kullback-Leibler (KL) divergence to minimize the difference between predicted and true probability distributions.
result Optimized tree-based models yield superior alignment between predicted scores and actual probabilities without significant performance loss.
ALIEN improves uncertainty estimation of language models by refining entropy-based methods.
problem Overconfidence in uncertainty estimation for language models, especially for difficult inputs.
method ALIEN refines entropy-based uncertainty by aligning it with prediction reliability, using a lightweight uncertainty head.
result ALIEN consistently outperforms strong baselines in detecting incorrect predictions and achieving the lowest calibration error.