The paper approaches the task of handwritten text recognition (HTR) with attentional encoder-decoder networks trained on sequences of characters, rather than words. We experiment on lines of text from popular handwriting datasets and compare different activation functions for the attention mechanism used for aligning i…
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.
168,657 papers · 148 categories
Trend · papers per month
48 results for “alignment precision”
Framework improves clinical timeline reconstruction from text and tables.
problem Temporal precision and event timing in clinical narratives and EHRs.
method Retrieval-augmented multimodal alignment framework.
result Consistently improves absolute timestamp accuracy and temporal concordance.
The paper analyzes how deep models memorize spurious features.
problem Understanding how deep models memorize spurious features in training data.
method Characterizes spurious feature memorization via model stability and feature alignment.
result Memorization of spurious features weakens as generalization capability increases.
New method aligns brain surfaces based on functional signatures.
problem Inter-individual variability in neuroimaging data.
method Fused Unbalanced Gromov-Wasserstein (FUGW) based on Optimal Transport.
result FUGW significantly increases between-subject correlation of activity.
The study explains how neural networks align their kernels to target functions during training.
problem Understanding how neural networks align their kernels to target functions during training.
method Theoretical analysis of kernel evolution in toy models and deep networks.
result Kernel alignment naturally emerges during training to accelerate convergence and improve generalization.
The alignment time functionmath.DG
A function that optimally aligns a timelike vector field with its gradients
problem Finding a time function that aligns a timelike vector field with its gradients
method Introducing a functional that penalizes null gradients and minimizes misalignment
result Proving the existence of a unique alignment time function under suitable conditions
Paper tackles score following in full-page sheet music images.
problem Score following in unprocessed sheet music images.
method Directly predicts score positions from audio and image input.
result Outperforms state-of-the-art methods in alignment precision.
Paper proposes using LSTM for LSH-based sequence alignment.
problem Sequence alignment using deep learning models.
method Deep bidirectional LSTM for feature learning and LSH-based sequence alignment.
result Higher accuracy achieved with LSTM-based model.
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…
Mapping and translating professional but arcane clinical jargons to consumer language is essential to improve the patient-clinician communication. Researchers have used the existing biomedical ontologies and consumer health vocabulary dictionary to translate between the languages. However, such approaches are limited b…
Gradient descent reshapes the function space of neural networks.
problem Understanding how feature learning affects the function space of neural networks.
method Characterized the evolution of the feature space during training using a two-layer neural network.
result Gradient descent induces a data-adaptive deformation that selectively enhances signal-aligned directions.
In this paper, we develop a new aligned vertex convolutional network model to learn multi-scale local-level vertex features for graph classification. Our idea is to transform the graphs of arbitrary sizes into fixed-sized aligned vertex grid structures, and define a new vertex convolution operation by adopting a set of…
Framework controls uncertainty in LLMs without labels or probabilities.
problem Managing uncertainty in black-box LLMs without token-level probability or true labels.
method Integrates generative models, UCP, and conformal alignment to control uncertainty.
result Achieves close-to-nominal coverage and tighter thresholds than split UCP.
Study how large-scale flows align small-scale vortices in 3D Euler equations.
problem Understanding how large-scale flows align small-scale vortices in 3D Euler equations.
method Constructing a Lagrangian coordinate to identify when the Lie bracket is zero and investigating the locality of the pressure term.
result Clarified conditions under which small-scale vortices are aligned by large-scale flows.
Estimates multiple networks using graphons for non-aligned graphs.
problem Estimating topology of multiple networks from nodal observations.
method Combining maximum likelihood penalty with graphon estimation schemes.
result Validated performance against competing methods in synthetic and real-world datasets.
Paper characterizes optimal language model alignment methods.
problem Aligning language models to maximize reward while keeping them close to the original model.
method KL-constrained reinforcement learning and best-of-N methods.
result Optimal KL-constrained RL solution has a large deviation principle rate function.
Graph alignment problem solved with convex relaxations for correlated matrices.
problem Recovering hidden vertex permutations from correlated Gaussian matrices.
method Convex relaxations of the quadratic assignment problem over doubly stochastic matrices.
result The solution of the convex relaxation concentrates around the ground-truth permutation matrix for certain correlation parameters.
EAST aligns neural network classifiers with user-defined evaluation metrics.
problem Mismatch between neural network training and evaluation metrics leads to suboptimal performance.
method EAST uses dynamic thresholding, soft-set confusion matrix, and annealing to align neural network predictions with target evaluation metrics.
result EAST improves alignment between training objectives and evaluation metrics, outperforming existing methods.
A new method estimates protein evolutionary fields and couplings from alignments.
problem Estimating evolutionary fields and couplings from protein sequence alignments.
method Boltzmann machine with parallel, persistent Markov chain Monte Carlo method.
result Improved precision in predicting contact residue pairs.
Partial soft-matching distance improves neural representation comparison by allowing some neurons to remain unmatched.
problem Neural representations are noisy and contain outliers, making traditional matching methods unreliable.
method Extends soft-matching distance to a partial optimal transport setting, allowing some neurons to remain unmatched.
result Partial soft-matching provides robust correspondences that are more reliable under noise and outliers.
New method shortens and straightens curves, proving convergence and well-posedness.
problem Shortening and straightening of curves.
method Conceptual shift in curve shortening to tangent aligning, variational study of geometric flows.
result Proves convergence to a straight line and global well-posedness for various geometric flows.
Paper proves existence of a universal codebook for low-precision quantization.
problem Optimizing low-precision approximation of matrix products in machine learning.
method Develops a universal codebook that is near-optimal for all possible statistics of input data.
result Proves existence of a universal codebook with a 0.11 bit per dimension reduction in rate.
Proposes a novel approach for cluster-aware matching using Laplacian Optimal Transport.
problem Matching point clouds with intrinsic cluster structure requires robust region-to-region alignment over precise point-to-point correspondence.
method Laplacian Optimal Transport (LapOT) with regularization for cluster-aware matching and Refined Simultaneous Clustering (RSC) for consistent partitions.
result Laplacian Optimal Transport produces more consistent and meaningful alignments between point clouds.
The paper examines the consistency of item embeddings in recommendation systems.
problem The relevance of averaging item embeddings for user or concept representation.
method Proposes an expected precision score to measure consistency and analyzes it theoretically and empirically.
result Real-world averages are less consistent for recommendation compared to theoretical assumptions.
Formalizes vNM utility theorem using Lean 4, proving existence and uniqueness.
problem Formalizing and proving the von Neumann-Morgenstern utility theorem.
method Implement classical axioms in Lean 4, formalizing preference relations over lotteries.
result Machine-verified proofs of existence and uniqueness of utility representations.
Paper refines Einstein manifold result with cone curvature condition.
problem Closed Einstein manifolds with specific curvature conditions.
method Relaxing curvature condition to cone condition and proving manifold properties.
result Closed Einstein manifolds of dimension 4, 5, or ≥8 are either flat or round spheres under the cone curvature condition.
We construct finite time blow-up solutions to the 2-dimensional harmonic map flow into the sphere , \begin{align*} u_t & = Δu + |\nabla u|^2 u \quad \text{in } Ω\times(0,T) \\ u &= \varphi \quad \text{on } \partial Ω\times(0,T) \\ u(\cdot,0) &= u_0 \quad \text{in } Ω, \end{align*} where is a bounded, smooth do…
CATS adapts multivariate time series models by addressing correlation shift.
problem Correlation differences across domains in multivariate time series data.
method CATS introduces correlation shift to measure domain differences, and uses a graph attention module and temporal convolution to align target correlations with source correlations.
result CATS increases over 10% average accuracy compared to vanilla Transformer-based models with minimal additional parameters.
Cross-lingual document alignment aims to identify pairs of documents in two distinct languages that are of comparable content or translations of each other. In this paper, we exploit the signals embedded in URLs to label web documents at scale with an average precision of 94.5% across different language pairs. We mine …
This paper surveys scalable automated alignment methods for LLMs.
problem Scalability issues in traditional human-annotated alignment methods for LLMs.
method Categorizes and discusses various automated alignment methods.
result Emerging automated alignment methods are effective and scalable.
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.
Conformal Alignment ensures trustworthy outputs from foundation models.
problem Ensuring outputs from foundation models align with human values in high-stakes tasks.
method A framework that trains an alignment predictor using reference data to select trustworthy outputs.
result Conformal Alignment accurately identifies trustworthy outputs via lightweight training over moderate reference data.
Uniform heat kernel bounds lead to synthetic Ricci curvature conditions for Lipschitz manifolds.
problem Establishing synthetic Ricci curvature conditions for Lipschitz manifolds.
method Uniform heat kernel bounds and synthetic Ricci curvature conditions.
result Uniform heat kernel bounds lead to synthetic Ricci curvature conditions for Lipschitz manifolds.
We construct finite time blow-up solutions to the 3-dimensional harmonic map flow into the sphere , \begin{align*} u_t & = Δu + |\nabla u|^2 u \quad \text{in } Ω\times(0,T) \\ u &= u_b \quad \text{on } \partial Ω\times(0,T) \\ u(\cdot,0) &= u_0 \quad \text{in } Ω, \end{align*} with $u(x,t): \bar Ω\times [0,T) \to …
Generative model tackles inconsistent attributes across datasets by enabling precise conditional generation.
problem Inconsistent attributes across merged datasets limit controllability in conditional generative modeling.
method Diffusion Model with Double Guidance, maintaining control over multiple conditions without joint annotations.
result Outperforms baselines in molecular and image generation tasks, aligning with target distributions and controlling missing conditions.
The paper analyzes deflation for estimating a low-rank spike in large tensors with noise.
problem Estimating a low-rank symmetric spike in large tensors with additive Gaussian noise.
method Characterization of deflation performance in terms of vector alignments and weights.
result Understanding deflation mechanism in noisy conditions and designing more efficient methods.
LPL optimizes embeddings to align local neighborhoods, improving cross-lingual word alignment.
problem Aligning embeddings across different datasets and languages.
method Locality Preserving Loss (LPL) optimizes model to project embeddings while maintaining local neighborhoods and aligning them.
result LPL-based alignment leads to better and consistent accuracy, especially in small training set settings.
f-GRPO and Beyond: Divergence-Based Reinforcement Learning Algorithms for General LLM Alignmentcs.LG
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.
The paper proposes a learning-theoretic perspective on representation alignment.
problem Understanding how AI models' representations become aligned as they scale.
method Reviewing and connecting different notions of alignment, focusing on stitching.
result Relating properties of stitching to kernel alignment of representations.
Survey of alignment techniques for large language models.
problem Ensuring large language models align with human values.
method Analysis of diverse alignment methods and training paradigms.
result Preference-based methods offer more flexibility for nuanced alignment.
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.
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.
A new method for computing shape barycenters from point clouds using Procrustes-Wasserstein distance.
problem Computing representative shapes from point clouds with precise alignment and shape preservation.
method Developed a new distance metric (Procrustes-Wasserstein) and algorithms for computing barycenters.
result Superior performance in precise alignment and shape preservation compared to existing OT approaches.
Bayesian framework proves thresholds for multi-graph alignment feasibility.
problem Determining when multi-graph alignment is statistically possible.
method Developed a Bayesian estimation framework over metric spaces.
result Identified thresholds for Gaussian and sparse Erdős-Rényi models.
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.
New method aligns brain data across individuals for better brain decoding.
problem Inter-individual variability in brain response patterns limits decoder generalization.
method SpectralOT method that embeds cortical geometry into Laplace-Beltrami eigenmodes.
result SpectralOT strikes balance between aligning functional features and preserving anatomical structure.
Method aligns multilingual news for better stock return prediction.
problem Losing nuances in multilingual news translations.
method Optimal transport for sentence alignment.
result Aligned sentences correlate better with stock returns.
This paper studies aligning knowledge graphs from different sources or languages. Most existing methods train supervised methods for the alignment, which usually require a large number of aligned knowledge triplets. However, such a large number of aligned knowledge triplets may not be available or are expensive to obta…