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

59118176235 · Jun 202019922001200920172026
48 results for correction vectors

The paper "Minimal unit vector fields" by O. Gil-Medrano and E. Llinares-Fuster \cite{GilLli1}. is a seminal paper in the field that has been cited by many authors. It contains, however, a minor technical mistake in Theorem 14 that is important to fix. In this short note, we will provide a correction to that result.

2012-11-08abs ↗pdf ↗

A new method for math reasoning that allows for iterative correction.

problem Standard reasoning models commit to each token and cannot recover from early errors.
method Generative framework with latent thought vectors for iterative self-correction.
result 30 rethinking iterations surpass baselines with 15 times more parameters.

An associative memory is a framework of content-addressable memory that stores a collection of message vectors (or a dataset) over a neural network while enabling a neurally feasible mechanism to recover any message in the dataset from its noisy version. Designing an associative memory requires addressing two main task…

2016-11-29abs ↗pdf ↗

Paper designs optimal ECOCs using IP for robust multiclass classification.

problem Designing robust ECOCs for multiclass classification.
method Integer Programming formulation to minimize codebooks with desirable error-correcting properties, leveraging graph-theoretic structure and edge clique covers.
result IP-generated codebooks achieve high nominal and robust adversarial accuracy.

The paper proposes a new model to analyze directed networks and accurately estimate community memberships.

problem Modeling and estimating community memberships in directed networks with heterogeneous degrees.
method Directed Degree Corrected Mixed Membership (DiDCMM) model and DiMSC algorithm.
result The proposed DiMSC algorithm is asymptotically consistent and provides error bounds for community membership vectors.

We apply the graph complex method to vector fields depending naturally on a set of vector fields and a linear symmetric connection. We characterize all possible systems of generators for such vector-field valued operators including the classical ones given by normal tensors and covariant derivatives. We also describe t…

2008-09-06abs ↗pdf ↗

CUTS removes corruption from models without clean data, improving utility and security.

problem Removing corruption from models without access to clean training data.
method CUTS uses a proxy set to amplify corruption and subtract it from model weights.
result CUTS recovers a large fraction of lost utility and nearly eliminates attacks with minimal damage.

We introduce several techniques for sampling and visualizing the latent spaces of generative models. Replacing linear interpolation with spherical linear interpolation prevents diverging from a model's prior distribution and produces sharper samples. J-Diagrams and MINE grids are introduced as visualizations of manifol…

2016-09-14abs ↗pdf ↗

This paper establishes non-asymptotic oracle inequalities for the prediction error and estimation accuracy of the LASSO in stationary vector autoregressive models. These inequalities are used to establish consistency of the LASSO even when the number of parameters is of a much larger order of magnitude than the sample …

2013-11-04abs ↗pdf ↗

We present a new trace estimator of the matrix whose explicit form is not given but its matrix multiplication to a vector is available. The form of the estimator is similar to the Hutchison stochastic trace estimator, but instead of the random noise vectors in Hutchison estimator, we use small number of probing vectors…

2016-06-16abs ↗pdf ↗

Given vector representations for individual words, it is necessary to compute vector representations of sentences for many applications in a compositional manner, often using artificial neural networks. Relatively little work has explored the internal structure and properties of such sentence vectors. In this paper, we…

2018-10-16abs ↗pdf ↗

We propose ββ-graph embedding for robustly learning feature vectors from data vectors and noisy link weights. A newly introduced empirical moment ββ-score reduces the influence of contamination and robustly measures the difference between the underlying correct expected weights of links and the specified generative m…

2019-02-22abs ↗pdf ↗

The paper corrects for node degree in spectral clustering using random walk Laplacian.

problem Node degree heterogeneity in spectral clustering.
method Graph spectral embedding using the random walk Laplacian.
result The embedding provides uniformly consistent estimates of degree-corrected latent positions.

New method for high-dimensional manifold-based inference tackles latent responses.

problem Inference on latent right factor vectors in multi-task learning with large numbers of responses and features.
method SOFARI-R method with two variants: one for strongly orthogonal factors and another for weakly orthogonal factors.
result Bias-corrected estimators for latent right factor vectors with asymptotically normal distributions and justified asymptotic variance estimates.

We construct a geometric structure on deformed supermanifolds as a certain subalgebra of the vector fields. In the classical limit we obtain a decoupling of the infinitesimal odd and even transformations, whereas in the semiclassical limit the result is a representation of the supersymmetry algebra. In the case of mass…

2007-07-24abs ↗pdf ↗

Label smoothing improves model performance even with noisy labels.

problem Mitigating label noise in deep learning models.
method Examined label smoothing as a technique to cope with label noise and compared it to loss-correction methods.
result Label smoothing is competitive with loss-correction techniques under label noise and beneficial for distillation from noisy data.

We give a new and self-contained proof of the existence and unicity of the flow for an arbitrary (not necessarily homogeneous) smooth vector field on a real supermanifold, and extend these results to the case of holomorphic vector fields on complex supermanifolds. Furthermore we discuss local actions associated to supe…

2012-10-03abs ↗pdf ↗

We present a geometrical framework which incorporates higher derivative corrections to the action of N = 2 vector multiplets in terms of an enlarged scalar manifold which includes a complex deformation parameter. This enlarged space carries a deformed version of special Kahler geometry which we characterise. The holomo…

2015-11-20abs ↗pdf ↗

Improves community detection in directed networks with theoretical guarantees.

problem Degree heterogeneity affects community detection in directed networks.
method Introduced D-SCORE algorithm and established theoretical guarantees for Directed-DCBM.
result Established theoretical guarantees and provided improvements for D-SCORE.

New system for i-vector speaker recognition based on variational autoencoder (VAE) is investigated. VAE is a promising approach for developing accurate deep nonlinear generative models of complex data. Experiments show that VAE provides speaker embedding and can be effectively trained in an unsupervised manner. LLR est…

2017-05-25abs ↗pdf ↗

We study first and second order conformal symmetries of the Yamabe Laplacian on a general pseudo-Riemannian manifold and of the Paneitz operator on Einstein spaces. We show that first order conformal symmetries of the Yamabe operator induce second order conformal symmetries. We show that on an Einstein space every conf…

2015-04-15abs ↗pdf ↗

This paper examines interest rates and market efficiency in DeFi loanable funds protocols.

problem Equilibrium of supply and demand for loanable funds in DeFi protocols.
method Review of interest rate mechanisms in Compound, Aave, and dYdX; empirical analysis of market efficiency and inter-connectedness.
result Interest rate rules in DeFi protocols do not always equilibrate supply and demand.

Contrastive learning recovers latent distributions for ambiguous inputs, including aleatoric uncertainty.

problem Real-world observations often have inherent ambiguities, making the true posterior probabilistic with heteroscedastic uncertainty.
method Extended InfoNCE objective and encoders to predict latent distributions, proving they recover the correct posteriors, including aleatoric uncertainty.
result Contrastive learning encoders can recover the correct posteriors of data-generating processes, including aleatoric uncertainty, up to a rotation of the latent space.

Quantum field theory connects deep neural networks to criticality.

problem Understanding the criticality and training dynamics of deep neural networks.
method Constructing quantum field theory for deep neural networks, computing corrections to correlation functions.
result Found precise analogy with O(N)O(N) vector model, providing corrections to correlation length.

Differential privacy is a framework for privately releasing summaries of a database. Previous work has focused mainly on methods for which the output is a finite dimensional vector, or an element of some discrete set. We develop methods for releasing functions while preserving differential privacy. Specifically, we sho…

2012-03-12abs ↗pdf ↗

We completely describe paracontact metric three-manifolds whose Reeb vector field satisfies the Ricci soliton equation. While contact Riemannian (or Lorentz\-ian) Ricci solitons are necessarily trivial, that is, KK-contact and Einstein, the paracontact metric case allows nontrivial examples. Both homogeneous and inhom…

2014-07-13abs ↗pdf ↗

We present Vector-Space Markov Random Fields (VS-MRFs), a novel class of undirected graphical models where each variable can belong to an arbitrary vector space. VS-MRFs generalize a recent line of work on scalar-valued, uni-parameter exponential family and mixed graphical models, thereby greatly broadening the class o…

2015-05-19abs ↗pdf ↗

Lossy compression of statistical data using quantum annealing.

problem Efficiently compressing statistical floating-point data.
method Representation learning with binary variables, classical optimization of basis vectors, quantum annealing for coefficients, bias correction.
result Quantum annealing shows promising results with 3.5x better compression than neural-network autoencoders.

New construction reveals SU(2)-flavor fields in heterotic M5-brane model.

problem Tackles the emergence of SU(2)-flavor fields in heterotic M5-brane models.
method Classifies super-exceptional field content and works out interactions.
result SU(2)xU(1)-valued scalar and vector fields emerge from probe M2- and M5-branes.

Selecting the right drugs for the right patients is a primary goal of precision medicine. In this manuscript, we consider the problem of cancer drug selection in a learning-to-rank framework. We have formulated the cancer drug selection problem as to accurately predicting 1). the ranking positions of sensitive drugs an…

2018-01-23abs ↗pdf ↗