Research
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.

169,051 papers · 148 categories

Trend · papers per month

67134200267 · May 202619922001200920182026
48 results for alignment type D

Paper addresses reward hacking in preference optimization, proposing POWER-DL to improve AI alignment.

problem Reward hacking problem in preference optimization, leading to undesired behaviors.
method POWER-DL combines robust reward maximization and dynamic label updates to mitigate reward hacking.
result POWER-DL consistently outperforms state-of-the-art methods on alignment benchmarks.

New system constructs cell-type taxonomy across multiple samples.

problem Challenges in matching clusters from different datasets.
method Combines Optimal Transport with Relaxed Marginal Constraints (OT-RMC) for simultaneous alignment of clusters across multiple samples.
result Highly accurate annotation of cell types and sample-level feature extraction.

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.

Study on type-D metrics aligned with Einstein-Maxwell equations, deriving solutions.

problem Understanding metrics with specific Weyl tensor types and their properties.
method Reinterpretation of Araneda's results using Toda field equation and application of Ward's method.
result Metrics can be expressed using solutions of the SU()SU(\infty)-Toda field equation and axisymmetric solutions of the Laplacian.

Study analyzes Hotelling-type tensor deflation for spiked tensors, providing insights into signal and noise.

problem Characterizing singular values and alignments in Hotelling-type tensor deflation.
method Asymptotic study of Hotelling-type tensor deflation in large dimensional regime using random tensor theory.
result Characterization of singular values and alignments at each step of the deflation procedure.

We present a model that can automatically learn alignments between high-dimensional data in an unsupervised manner. Our proposed method casts alignment learning in a framework where both alignment and data are modelled simultaneously. Further, we automatically infer groupings of different types of sequences within the …

2018-03-07abs ↗pdf ↗

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.

GDA-HIN adapts across heterogeneous networks by aligning shared and private node types.

problem Domain adaptation challenges in heterogeneous networks with shared and private node types.
method Generalized Domain Adaptive model across HINs (GDA-HIN) that aligns identical-type nodes and edges while utilizing different-type nodes and edges.
result GDA-HIN outperforms state-of-the-art methods in various domain adaptation tasks across heterogeneous networks.

Study proves energy critical heat equation solutions are Type I blowups for n ≥ 7.

problem Analyzing blowup behavior of energy critical nonlinear heat equations.
method Reverse inner-outer gluing mechanism and bubbling behavior analysis.
result Proves all blowups are of Type I for n ≥ 7.

Better data representations can simplify learning tasks by aligning model distributions with true data distributions.

problem Learning complexity influenced by the alignment of model distributions with true data distributions.
method Analyzed the effect of data representations on learning complexity using a task complexity score and information coding length.
result Better representations can simplify learning tasks by aligning model distributions with true data distributions, improving learning outcomes.

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.

DRO-REBEL improves LLM alignment by robustly updating models online.

problem Overfitting and drifting of LLMs during RLHF.
method DRO-REBEL uses type-pp Wasserstein, KL, and χ2χ^2 ambiguity sets for robust online updates.
result DRO-REBEL achieves faster convergence and better performance than prior methods.

The paper proves an equilibrium in a limited stock market participation model with power utilities.

problem Existence of an equilibrium in a model with limited stock market participation and power utilities.
method Proves existence and uniqueness of a solution to a singular and path-dependent Riccati-type ODE.
result Proves existence of a Radner equilibrium with homogenous power-utility investors.

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.

DACNN improves skeleton-based action recognition and segmentation.

problem Lack of spatial relationships and non-uniform temporal scalings in skeleton-based data.
method Introduces deep-aligned convolutional neural network (DACNN) with new filters trained on local subsequences.
result DACNN achieves competitive performance compared to state-of-the-art models.

This paper classifies CSI Kundt metrics related to locally homogeneous degenerate Kundt metrics.

problem Classifying CSI Kundt metrics related to locally homogeneous degenerate Kundt metrics.
method Invariant classification of locally homogeneous CSI Kundt spacetimes of alignment type D.
result Any CSI Kundt metric can be constructed from the classified locally homogeneous ones.

We investigate the relation between quadrics and their Christoffel duals on the one hand, and certain zero mean curvature surfaces and their Gauss maps on the other hand. To study the relation between timelike minimal surfaces and the Christoffel duals of 1-sheeted hyperboloids we introduce para-holomorphic elliptic fu…

2017-01-09abs ↗pdf ↗

The paper proposes a method to align surgical videos using kinematic data.

problem Difficulty in learning from comparing novice to expert surgical videos due to variability in gesture duration and execution.
method A novel technique using Dynamic Time Warping to synchronize videos of the same gesture at different speeds.
result The proposed approach allows for the alignment of surgical videos, enabling better learning for novice trainees.

A new multi-view clustering method using deep matrix decomposition and partition alignment.

problem Improving multi-view clustering methods to better utilize data representations and view-specific structures.
method Deep matrix decomposition for partition representations, joint use of partition representations, and alternating optimization.
result Demonstrated effectiveness on six benchmark datasets compared to state-of-the-art methods.

Researchers found a new type of singularity in surface evolution equations.

problem Finite-time singularity formation in surface evolution equations.
method Constructed first example of finite time blow-up solutions for the heat flow of the H-system.
result Singularity forms as a scaled least energy H-bubble with decoupled linearized operators.

Paper proposes a probabilistic alignment method for domain adaptation.

problem Latent distribution mismatch and miscalibrated uncertainty in adapting large-scale models.
method Bayesian latent transport framework with PAC-Bayesian regularization.
result Reduction in latent manifold discrepancy and improved uncertainty calibration.

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.

This study analyzes the alignment between charter value and supervision in banks.

problem The alignment between charter value and supervision in banks is complex and varies by risk type.
method Classification and regression tree analysis using the CAMELS rating system.
result Supervision and charter value are aligned for some types of risk.

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.

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.

Paper proposes unsupervised knowledge graph alignment with adversarial learning.

problem Aligning knowledge graphs from different sources or languages without large amounts of aligned triplets.
method Adversarial learning framework to align entity and relation embeddings, with mutual information regularization.
result Framework effectively aligns knowledge graphs in unsupervised and weakly-supervised settings.

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.