The paper addresses rigid alignment of noisy patches, providing a polynomial time algorithm and convergence conditions.
problem Finding a rigid alignment of overlapping local views (patches) that minimizes alignment error in a noisy setting.
method Characterizes non-degeneracy based on kernel and positivity of a matrix, provides polynomial time algorithm for testing non-degeneracy, and uses Riemannian gradient descent for alignment.
result The algorithm converges locally linearly to a non-degenerate perfect alignment under certain conditions.
We consider the problem of aligning a pair of databases with jointly Gaussian features. We consider two algorithms, complete database alignment via MAP estimation among all possible database alignments, and partial alignment via a thresholding approach of log likelihood ratios. We derive conditions on mutual informatio…
Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact information-theoretic threshold for graph alignment in correlated Erdős-Rényi graphs. However, very little is known about the existence of e…
Inference-aware meta-alignment of LLMs reduces computational cost.
problem Aligning LLMs to diverse human preferences is challenging due to conflicting criteria.
method IAMA trains a base model to be aligned to multiple tasks via different inference-time alignment algorithms, using non-linear GRPO for optimization.
result IAMA enables effective alignment of LLMs to multiple criteria with limited computational budget.
Graph Neural Networks align with dynamic programming, improving algorithmic reasoning.
problem Demonstrate and quantify alignment between GNNs and dynamic programming.
method Category theory and abstract algebra methods to expose intricate connection.
result Showed GNNs align with dynamic programming beyond individual algorithms.
Algorithm aligns 3D density maps using Wasserstein distance.
problem Aligning 3D density maps in cryogenic electron microscopy.
method Minimizing 1-Wasserstein distance after rigid transformation using Bayesian optimization.
result Improved accuracy and efficiency in protein molecule alignment.
An efficient algorithm for aligning diffusion trees to networks with information asymmetry.
problem Aligning diffusion trees to networks with information asymmetry.
method Tree correlation tests for extracting alignment information.
result Explicit lower bounds on the probability of correct matches for each vertex on the diffusion tree.
Unified framework simplifies DPO algorithms for LLM alignment.
problem Vast number of DPO variants complicates model alignment.
method Mutual information inspired unifying framework with flexible priors.
result Many DPO variants can be derived from the new framework.
New model optimizes feature alignment, improving statistical and computational efficiency.
problem Statistical and computational challenges in feature alignment.
method Covariance alignment model, Gromov-Wasserstein algorithm.
result Gromov-Wasserstein algorithm is minimax optimal and practical for covariance alignment.
Study compares DSPy teleprompter algorithms for aligning LLM evaluations with human annotations.
problem Aligning LLM evaluation metrics with human annotations.
method Comparative analysis of five teleprompter algorithms within the DSPy framework.
result Certain teleprompters outperform others in detecting hallucinations.
We first introduce a novel profile-based alignment algorithm, the multiple continuous Signal Alignment algorithm with Gaussian Process Regression profiles (SA-GPR). SA-GPR addresses the limitations of currently available signal alignment methods by adopting a hybrid of the particle smoothing and Markov-chain Monte Carl…
Study connects database alignment and planted matching using Gaussian features.
problem Identify matching between correlated user features in anonymized databases.
method Derived results for database alignment and planted matching, showing connections and thresholds.
result Performance thresholds for database alignment converge to planted matching when feature dimensionality is sufficiently high.
Study on matching nodes between graphs to preserve edges, focusing on limits and algorithms.
problem Matching nodes between graphs to preserve most edges, especially in random graphs.
method Investigates fundamental limits and designs algorithms to recover alignments in planted graphs.
result High probability guarantees on the success or failure of graph alignment algorithms.
A new method for aligning multiple distributions efficiently.
problem Aligning multiple distributions in a shared latent space.
method Iterative alignment of variational approximations of distribution divergences using invertible alignment maps.
result Our method achieves competitive distribution alignment at low computational cost.
Improved algorithm for network alignment with binary diffing application.
problem Network alignment problem and binary diffing.
method Inspired by Bayati et al. [2], the algorithm uses message passing with modifications for speed and convergence.
result Our model outperforms state-of-the-art solvers in experiments.
Faster WIND accelerates iterative BOND for LLM alignment.
problem Iterative BOND is inefficient in practice due to sample and computation inefficiency.
method Unified game-theoretic connection to self-play alignment, WIND framework with efficient algorithms.
result WIND variant achieves superior sample efficiency and faster computation.
We present Manifold Alignment Determination (MAD), an algorithm for learning alignments between data points from multiple views or modalities. The approach is capable of learning correspondences between views as well as correspondences between individual data-points. The proposed method requires only a few aligned exam…
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…
New approach speeds up DNA sequence alignment.
problem Efficiently estimating alignment scores for large sets of reads.
method Rank-one crowdsourcing models and multi-armed bandit algorithm.
result Adaptive algorithm identifies pairs with large alignment scores.
PIPA aligns preferences without reinforcement learning, improving language model performance.
problem Aligning preferences in language models efficiently and without reinforcement learning.
method Formulates preference alignment as a Maximum Likelihood Estimation problem with prior constraints.
result PIPA algorithms achieve up to 10% performance improvement on benchmarks.
Novel PO algorithms improve LLM alignment tasks.
problem Evaluating PO algorithms on LLM alignment is costly and noisy.
method Designed a diagnostic suite of MuJoCo tasks and datasets, used evolutionary strategies to discover specialized PO algorithms.
result Proposed MPO algorithms significantly outperform existing PO algorithms in LLM alignment.
Proposes a robust algorithm for aligning large language models with human preferences.
problem Misspecification in preference models, reference policies, and reward functions.
method Doubly robust preference optimization algorithm.
result Superior and more robust performance compared to state-of-the-art algorithms.
New algorithm shows neural networks can learn without full backpropagation.
problem Stochastic gradient descent with backpropagation is non-biologically plausible.
method Random and fixed backpropagation weights in a feedback alignment algorithm.
result Error converges to zero exponentially fast in overparameterized networks.
Extends reinforcement learning alignment to scalar rewards, improving math reasoning.
problem Designing reinforcement learning algorithms for general LLM alignment.
method Introduces f-GRPO and f-HAL, estimating f-divergences between reward-aligned and unaligned distributions.
result Improves math reasoning RLVR tasks and mitigates reward hacking.
FCA improves fair clustering by optimizing utility and fairness.
problem Balancing fairness and utility in clustering.
method FCA alternates between aligning data and optimizing cluster centers in an aligned space.
result FCA achieves a superior trade-off between fairness and utility.
Paper develops a new unsupervised scoring function for cross-lingual document alignment.
problem Aligning documents across different languages for NLP tasks.
method Uses cross-lingual sentence embeddings to compute semantic distances and guides document alignment.
result The proposed scoring function outperforms current methods by 7-22% on various language pairs.
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.
Detecting correlated trees helps align sparse graphs.
problem Detecting correlation between trees for sparse random graphs.
method MPAlign message-passing algorithm for graph alignment.
result MPAlign succeeds in polynomial time for partial alignment.
A new method reduces the computational burden of safety alignment for large language models.
problem Safety concerns in large language models and the need to align them with human preferences.
method Optimal dualization approach to reduce constrained alignment to an unconstrained problem.
result Our algorithms MoCAN and PeCAN significantly reduce computational burden and improve training stability.
Align-RUDDER improves reinforcement learning with few demonstrations by redistributing rewards.
problem Learning complex tasks with sparse and delayed rewards using few demonstrations.
method Align-RUDDER uses a profile model for reward redistribution based on multiple sequence alignment of demonstrations.
result Align-RUDDER outperforms competitors on complex tasks with few demonstrations.
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.
A new FFT-based method for fast rigid alignment of 2D closed curves.
problem Rigid alignment of 2D closed curves with application to shape analysis.
method FFT-based algorithm for optimal rigid alignment of closed curves with O(N log N) complexity.
result Order of magnitude speed-up in curve alignment compared to previous methods.
MREC efficiently matches and aligns point clouds, useful for single cell molecular data.
problem Comparing and aligning large datasets across various domains.
method Recursive decomposition algorithm for matching data sets, optimizing over partitioning and matching algorithms.
result Demonstrates flexibility and power in applying MREC to single cell molecular data alignment problems.
In real-world, many problems can be formulated as the alignment between two geometric patterns. Previously, a great amount of research focus on the alignment of 2D or 3D patterns, especially in the field of computer vision. Recently, the alignment of geometric patterns in high dimension finds several novel applications…
SMAI framework tests and integrates single-cell data alignability.
problem Lack of a rigorous statistical test for alignability and distortion during alignment.
method Spectral manifold alignment and inference (SMAI) framework.
result SMAI outperforms existing methods in alignability testing and integration.
Kernel alignment measures the degree of similarity between two kernels. In this paper, inspired from kernel alignment, we propose a new Linear Discriminant Analysis (LDA) formulation, kernel alignment LDA (kaLDA). We first define two kernels, data kernel and class indicator kernel. The problem is to find a subspace to …
We study the question of how to imitate tasks across domains with discrepancies such as embodiment, viewpoint, and dynamics mismatch. Many prior works require paired, aligned demonstrations and an additional RL step that requires environment interactions. However, paired, aligned demonstrations are seldom obtainable an…
Unified framework for aligning and composing diffusion models to satisfy multiple constraints.
problem Improving quality and compliance of generated samples from diffusion models.
method Constrained optimization framework that unifies alignment and composition of diffusion models.
result Proposed framework effectively satisfies multiple constraints in image generation.
Sparse text alignments learned via optimal transport improve model explainability.
problem Building self-explaining models by selecting relevant text pieces.
method Employing optimal transport to find minimal cost alignments, introducing constrained variants for sparsity.
result Sparse and interpretable alignments achieved, preserving prediction accuracy.
New RLHF approach mitigates bias in aligning LLMs with human preferences.
problem Algorithmic bias in RLHF leading to preference collapse.
method Preference Matching (PM) RLHF, using PM regularizer and conditional variant.
result 29% to 41% improvement in alignment with human preferences.
CARDS improves decoding efficiency and alignment quality for LLMs.
problem Efficiency bottlenecks in decoding-time alignment for LLMs.
method Cascade Reward Sampling (CARDS) with segment-level rejection sampling and uncertainty-based segmentation.
result Significant improvement in decoding efficiency and alignment quality.
DFA trains deep networks by aligning weights then memorizing data.
problem Understanding why DFA works for some networks but not others.
method Two-step learning process: alignment followed by memorization.
result DFA aligns weights to maximize gradient alignment, breaking degeneracy.
LoRA-One uses one-step full gradient to align adapters for efficient large model fine-tuning.
problem Fine-tuning large language models efficiently and accurately.
method Properly initializing LoRA adapters using the one-step full gradient and incorporating preconditioners.
result LoRA-One achieves significant empirical improvements over existing methods.
Given two graphs, the graph matching problem is to align the two vertex sets so as to minimize the number of adjacency disagreements between the two graphs. The seeded graph matching problem is the graph matching problem when we are first given a partial alignment that we are tasked with completing. In this paper, we m…
FA algorithm provides convergence guarantees for deep linear networks.
problem Training efficiency and convergence of deep neural networks.
method Theoretical analysis of Feedback Alignment (FA) algorithm for deep linear networks.
result Certain initializations lead to implicit anti-regularization, affecting learning effectiveness.
Domain adaptation addresses the common problem when the target distribution generating our test data drifts from the source (training) distribution. While absent assumptions, domain adaptation is impossible, strict conditions, e.g. covariate or label shift, enable principled algorithms. Recently-proposed domain-adversa…
Neural networks have succeeded in many reasoning tasks. Empirically, these tasks require specialized network structures, e.g., Graph Neural Networks (GNNs) perform well on many such tasks, but less structured networks fail. Theoretically, there is limited understanding of why and when a network structure generalizes be…
Geometric approach for unsupervised word embedding alignment.
problem Learning alignment between word embeddings of source and target languages.
method Formulates alignment as domain adaptation on the manifold of doubly stochastic matrices, employing Riemannian conjugate gradient algorithm.
result Empirically outperforms state-of-the-art methods on bilingual lexicon induction tasks.