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.

168,695 papers · 148 categories

Trend · papers per month

66132197263 · Jun 202019922001200920172026
48 results for projective codes

The study connects projective codes to the distribution of zeros of odd maps.

problem Understanding the distribution of zeros of odd maps from spheres to Euclidean space.
method Using the topology of the space of probability measures on the sphere.
result Generalization of the Borsuk-Ulam theorem and its four consequences.

Detects project management anti-patterns using code and issue data.

problem Detecting project management anti-patterns requires expert judgment and is expensive.
method Convert descriptions to detectable metrics, quantify deviations, and optimize patterns.
result Automatic calibration enhances pattern detection and severity assessment.

We introduce a differential geometric framework for describing families of quantum error-correcting codes and for understanding quantum fault tolerance. This work unifies the notion of topological fault tolerance with fault tolerance in other kinds of quantum error-correcting codes. In particular, we use fibre bundles …

2013-09-26abs ↗pdf ↗

Existing language models such as n-grams for software code often fail to capture a long context where dependent code elements scatter far apart. In this paper, we propose a novel approach to build a language model for software code to address this particular issue. Our language model, partly inspired by human memory, i…

2016-08-09abs ↗pdf ↗

Hyperplane hashing aims at rapidly searching nearest points to a hyperplane, and has shown practical impact in scaling up active learning with SVMs. Unfortunately, the existing randomized methods need long hash codes to achieve reasonable search accuracy and thus suffer from reduced search speed and large memory overhe…

2012-06-18abs ↗pdf ↗

In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. The design of good curves for this purpose relies on geometrical properties of spherical codes and projections of NN-dimensional lattices. We propose a constructive scheme based on a set of curves on …

2012-02-09abs ↗pdf ↗

Binary embedding of high-dimensional data requires long codes to preserve the discriminative power of the input space. Traditional binary coding methods often suffer from very high computation and storage costs in such a scenario. To address this problem, we propose Circulant Binary Embedding (CBE) which generates bina…

2014-05-13abs ↗pdf ↗

Automation engineering is the task of integrating, via software, various sensors, actuators, and controls for automating a real-world process. Today, automation engineering is supported by a suite of software tools including integrated development environments (IDE), hardware configurators, compilers, and runtimes. The…

2019-09-06abs ↗pdf ↗

We present a neural model for representing snippets of code as continuous distributed vectors ("code embeddings"). The main idea is to represent a code snippet as a single fixed-length code vector\textit{code vector}, which can be used to predict semantic properties of the snippet. This is performed by decomposing code to a col…

2018-03-26abs ↗pdf ↗

A new metric predicts model performance on unseen data.

problem Predicting performance on out-of-distribution data without labels.
method Uses model predictions to pseudo-label data, trains a new model, and measures difference from in-distribution models.
result Empirically outperforms existing methods on image and text classification tasks.

Proteins are linear molecular chains that often fold to function. The topology of folding is widely believed to define its properties and function, and knot theory has been applied to study protein structure and its implications. More that 97% of proteins are, however, classified as unknots when intra-chain interaction…

2019-12-19abs ↗pdf ↗

The way developers collaborate inside and particularly across teams often escapes management's attention, despite a formal organization with designated teams being defined. Observability of the actual, organically formed engineering structure provides decision makers invaluable additional tools to manage their talent p…

2019-05-07abs ↗pdf ↗

Projection pursuit model improves Gaussian process regression for high-dimensional data.

problem Scalability issues with traditional Gaussian process models in high dimensions.
method Additive Gaussian process regression with dimension expansion and gradient descent.
result The proposed method approximates more complex functions and outperforms traditional models.

The simulator is an R package that streamlines the process of performing simulations by creating a common infrastructure that can be easily used and reused across projects. Methodological statisticians routinely write simulations to compare their methods to preexisting ones. While developing ideas, there is a temptatio…

2016-06-30abs ↗pdf ↗

We introduce the Randomized Dependence Coefficient (RDC), a measure of non-linear dependence between random variables of arbitrary dimension based on the Hirschfeld-Gebelein-Rényi Maximum Correlation Coefficient. RDC is defined in terms of correlation of random non-linear copula projections; it is invariant with respec…

2013-04-29abs ↗pdf ↗

New framework solves low-rank optimization problems to certifiable optimality.

problem Low-rank optimization problems with certifiable solutions.
method Mixed-Projection Conic Optimization framework using symmetric projection matrices and outer-approximation algorithms.
result Solves low-rank problems to certifiable optimality, outperforming existing methods.

Paper extends multivariate rank tests for robust subspace detection.

problem Testing distributional similarity in multivariate data.
method Soft and subspace robust multivariate rank tests based on entropy regularized optimal transport.
result Trade-off between detection power and false alarm rate via projections.

LDAdam optimizes large models with low memory by adapting to lower-dimensional subspaces.

problem Training large models efficiently and accurately.
method Adaptive optimization in lower-dimensional subspaces with a new projection-aware update rule and error feedback mechanism.
result LDAdam achieves accurate and efficient training of language models.

The fruit fly Drosophila's olfactory circuit has inspired a new locality sensitive hashing (LSH) algorithm, FlyHash. In contrast with classical LSH algorithms that produce low dimensional hash codes, FlyHash produces sparse high-dimensional hash codes and has also been shown to have superior empirical performance compa…

2020-01-14abs ↗pdf ↗

CPR adds entropy maximization to improve continual learning methods.

problem Catastrophic forgetting in continual learning.
method Classifier-Projection Regularization (CPR) adds an entropy maximization term to existing regularization methods.
result CPR improves accuracy and plasticity in continual learning methods.

TROLL improves RL for LLMs by replacing clipping with a trust region projection.

problem Clipping in RL for LLMs causes instability and suboptimal performance.
method TROLL uses a discrete differentiable trust region projection to replace clipping, balancing computational cost and effectiveness.
result TROLL consistently outperforms PPO-like clipping in training speed, stability, and final success rates.

STAR improves equivariant and invariant representation learning by routing projection heads.

problem Redundant feature learning in equivariant and invariant representation learning.
method Soft Task-Aware Routing (STAR) for projection heads specialization.
result Lower canonical correlations between invariant and equivariant embeddings.

This work proposes a collaborative multi-head attention layer to reduce model size without sacrificing accuracy.

problem Over-parameterization in transformer models trained with large datasets.
method Proposes a collaborative multi-head attention layer that shares key/query projections.
result Reduction in model size by 4 for same accuracy and speed.

Learning-based hashing algorithms are ``hot topics" because they can greatly increase the scale at which existing methods operate. In this paper, we propose a new learning-based hashing method called ``fast supervised discrete hashing" (FSDH) based on ``supervised discrete hashing" (SDH). Regressing the training exampl…

2019-04-07abs ↗pdf ↗

Paper introduces S3W distance for spherical probability distributions.

problem Comparing spherical probability distributions efficiently and accurately.
method S3W distance using stereographic projection and generalized Radon transform.
result Extensive theoretical analysis and evaluation of S3W performance.

Seglearn is an open-source python package for machine learning time series or sequences using a sliding window segmentation approach. The implementation provides a flexible pipeline for tackling classification, regression, and forecasting problems with multivariate sequence and contextual data. This package is compatib…

2018-03-21abs ↗pdf ↗

iREPA shows spatial structure, not global semantic, drives generation performance in REPA.

problem Understanding what aspect of the target representation matters for generation.
method Empirical analysis of 27 vision encoders, two modifications to REPA.
result Spatial structure, not global semantic, drives generation performance.

We describe discrete restricted Boltzmann machines: probabilistic graphical models with bipartite interactions between visible and hidden discrete variables. Examples are binary restricted Boltzmann machines and discrete naive Bayes models. We detail the inference functions and distributed representations arising in th…

2013-01-15abs ↗pdf ↗

SMART is an open source web application designed to help data scientists and research teams efficiently build labeled training data sets for supervised machine learning tasks. SMART provides users with an intuitive interface for creating labeled data sets, supports active learning to help reduce the required amount of …

2018-12-11abs ↗pdf ↗

WeldNet reduces complex dynamics to simpler, manageable segments.

problem Complex, high-dimensional time-dependent datasets from physical processes are costly to simulate.
method Windowed Encoders for Learning Dynamics, splitting time domain into windows for nonlinear dimension reduction and propagator training.
result WeldNet captures nonlinear latent structures and dynamics, outperforming existing methods.