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,982 papers · 148 categories

Trend · papers per month

2625247861,048 · Jun 202019922001200920172026
48 results for dirty paper coding

Study improves efficiency of MIMO systems' sum rate estimation.

problem Maximizing sum rate in MIMO systems with PAPC constraints.
method Proposes two new low-complexity approaches: alternating optimization and machine learning.
result Demonstrates superior performance compared to existing methods.

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 ↗

Data quality issues have attracted widespread attention due to the negative impacts of dirty data on data mining and machine learning results. The relationship between data quality and the accuracy of results could be applied on the selection of the appropriate algorithm with the consideration of data quality and the d…

2018-03-16abs ↗pdf ↗

For statistical learning, categorical variables in a table are usually considered as discrete entities and encoded separately to feature vectors, e.g., with one-hot encoding. "Dirty" non-curated data gives rise to categorical variables with a very high cardinality but redundancy: several categories reflect the same ent…

2018-06-04abs ↗pdf ↗

New research shows larger language models improve data processing for diverse entries.

problem Optimizing data processing for tables with diverse string entries.
method Analytical tasks on tables with varying language model sizes and a fuzzy join benchmark.
result Larger language models improve data processing for diverse entries, but fine-tuning is necessary.

In this article, we present an integration of any real finite-dimensional Leibniz algebra as a Lie rack which reduces in the particular case of a Lie algebra to the ordinary connected simply connected Lie group. The construction is not functorial.

2016-06-27abs ↗pdf ↗

PFP-BNNs offer a fast, deterministic approach to Bayesian neural networks.

problem Limited uncertainty handling in traditional neural networks restricts their use in safety-critical settings.
method Probabilistic Forward Pass (PFP) approximates Stochastic Variational Inference (SVI) for efficient BNNs.
result PFP-BNNs achieve up to 4200x speedup over SVI-BNNs while maintaining similar accuracy and uncertainty.

This work enhances GPS signals using robust GP regression for real-time high precision positioning.

problem Large noise in GPS signals degrades positioning accuracy.
method A three-step approach: signal validity tests, reweighting, and final model training.
result Proposed method achieves centimeter accuracy with 78.4% probability, outperforming other methods.

We derive a closed-form formula for computing bond prices between coupon payments. Our results cover both the `Treasury' and the `Street' pricing methods used by sovereign and corporate issuers. We apply our formulas to two UK gilts, the 8% Treasury Gilt 2015, and the 0.5% Treasury Gilt 2022, and show that we can obtai…

2018-01-18abs ↗pdf ↗

Paper explores how poisoning data can increase privacy risks in machine learning models.

problem Increasing privacy risks of benign training samples through data poisoning attacks.
method Proposes generic and optimization-based attacks to amplify membership exposure.
result Demonstrates substantial increase in membership inference precision with minimal model performance degradation.

Inspection-L detects illicit cryptocurrency transactions using GNNs and self-supervised learning.

problem Detect illicit cryptocurrency transactions for anti-money laundering.
method Graph Neural Network (GNN) framework based on self-supervised Deep Graph Infomax (DGI) and Graph Isomorphism Network (GIN) with supervised learning algorithms.
result Inspection-L outperforms state-of-the-art methods in key classification metrics.

DCoM uses deep neural networks to detect semantic data types from raw column values.

problem Detecting semantic data types from dirty and unseen data.
method DCoM employs multi-input NLP-based deep neural networks trained on 686,765 data columns.
result DCoM outperforms existing methods significantly on 78 different semantic data types.

Trimming helps in conformal prediction when it separates anomaly scores.

problem Effectiveness of trimming in conformal prediction under contamination.
method Analyse fixed-threshold trimming as a replacement of the contaminated calibration law with a retained law.
result Trimming helps when it separates anomaly scores, reducing clean-target coverage to a one-dimensional score-CDF transfer problem.

Sherlock uses deep learning to accurately detect data types from column headers.

problem Detecting accurate semantic types of data columns for data science tasks.
method Sherlock is a multi-input deep neural network trained on a corpus of 686,765 data columns.
result Sherlock achieves a support-weighted F1 score of 0.89, outperforming existing methods.

Paper proposes graph-based separable transforms for video coding.

problem Improving video coding efficiency by better capturing residual block statistics.
method Derives graph-based separable transforms (GBSTs) from line graphs with weights determined by parameters.
result GBSTs achieve about 0.4% average coding gain over existing transforms in VVC.

Usually considered as a classification problem, entity resolution (ER) can be very challenging on real data due to the prevalence of dirty values. The state-of-the-art solutions for ER were built on a variety of learning models (most notably deep neural networks), which require lots of accurately labeled training data.…

2018-10-29abs ↗pdf ↗

Paper presents a code authorship attribution attack using adversarial learning.

problem Misleading attribution of source code using machine learning methods.
method Exploits adversarial examples and semantics-preserving code transformations guided by Monte-Carlo tree search.
result Demonstrates substantial effect on attribution methods, reducing accuracy from over 88% to 1%.

This paper explores how random sampling and coding can speed up approximate matrix multiplication.

problem Efficiently computing large-scale matrix multiplications in distributed systems.
method Proposes two schemes: coding for recovery and random sampling for approximation.
result Investigates tradeoffs between recovery threshold and approximation error.

TreeCaps improves code comprehension for software developers.

problem Processing code efficiently for software developers.
method Tree-based capsule networks for capturing code syntactical structures and dependencies.
result TreeCaps outperforms other approaches in classifying program functionalities.

The paper optimizes querying schemes for crowdsourced classification using XOR queries.

problem Optimizing querying schemes for crowdsourced classification.
method Modeling crowdsourced labeling/classification as source coding problem, leveraging connections to channel coding.
result Provides querying schemes with almost optimal number of queries, each involving a constant number of labels.

In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand alone object and discuss its relationship with link diagrams. We give an explicit …

2013-09-12abs ↗pdf ↗

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the m…

2013-11-26abs ↗pdf ↗

Sparse linear regression -- finding an unknown vector from linear measurements -- is now known to be possible with fewer samples than variables, via methods like the LASSO. We consider the multiple sparse linear regression problem, where several related vectors -- with partially shared support sets -- have to be recove…

2011-06-29abs ↗pdf ↗

Paper develops a decoder for sparse codes without encoder matrix, achieving optimal recovery.

problem Designing a decoder for sparse codes from linear measurements alone.
method Matrix factorization to recover encoder and sparse coding matrices from measurements.
result Decoder-Expander Based Factorisation recovers encoder and sparse coding matrix at optimal measurement rate with high probability.

Gradient coding is a technique for straggler mitigation in distributed learning. In this paper we design novel gradient codes using tools from classical coding theory, namely, cyclic MDS codes, which compare favorably with existing solutions, both in the applicable range of parameters and in the complexity of the invol…

2017-07-12abs ↗pdf ↗

Paper explores understanding of neural source code embeddings.

problem Lack of understanding of contents and characteristics of code2vec embeddings.
method Small case study using code2vec embeddings to create binary SVM classifiers and compare performance with handcrafted features.
result Code2vec embeddings perform similarly to handcrafted features and have more evenly distributed information gains.

In order to submit a claim to insurance companies, a doctor needs to code a patient encounter with both the diagnosis (ICDs) and procedures performed (CPTs) in an Electronic Health Record (EHR). Identifying and applying relevant procedures code is a cumbersome and time-consuming task as a doctor has to choose from arou…

2017-12-01abs ↗pdf ↗

Paper proposes a novel approach to improve spatiotemporal precipitation forecasts.

problem Improving accuracy of spatiotemporal precipitation forecasts for flood damage mitigation.
method Introduces a rain-code fusion approach using ConvLSTM and multi-frame fusion for spatiotemporal precipitation code-to-code forecasting.
result Demonstrates enhanced accuracy in precipitation forecasts beyond 3 timesteps using the rain-code fusion.

This paper presents a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The method is based on empirical risk minimization within a certain class of linear operators, which map the set of coding vectors to the Hilbert space. Two results bounding the expected recon…

2010-02-03abs ↗pdf ↗

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been conside…

2014-09-08abs ↗pdf ↗

Sparse coding has shown its power as an effective data representation method. However, up to now, all the sparse coding approaches are limited within the single domain learning problem. In this paper, we extend the sparse coding to cross domain learning problem, which tries to learn from a source domain to a target dom…

2013-11-27abs ↗pdf ↗

A deep learning autoencoder improves error correction for one-bit quantization.

problem Improving error correction for one-bit quantization in AWGN channels.
method Proposes a novel autoencoder-based coding scheme using turbo codes as implicit regularization.
result Empirically and theoretically shows nearly optimal performance of the proposed coding scheme.

Determining the programming language of a source code file has been considered in the research community; it has been shown that Machine Learning (ML) and Natural Language Processing (NLP) algorithms can be effective in identifying the programming language of source code files. However, determining the programming lang…

2018-09-21abs ↗pdf ↗

In this paper we study output coding for multi-label prediction. For a multi-label output coding to be discriminative, it is important that codewords for different label vectors are significantly different from each other. In the meantime, unlike in traditional coding theory, codewords in output coding are to be predic…

2012-06-27abs ↗pdf ↗

Constrained sequence codes have been widely used in modern communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel, hence enabling efficient and reliable transmission of coded symbols. Traditional encoding and decoding of constrained …

2018-09-06abs ↗pdf ↗

DIMCO learns discrete codes maximizing mutual info with labels, reducing overfitting and improving efficiency.

problem Learning compact discrete representations for data.
method DIMCO learns k-way d-dimensional codes maximizing mutual information between codes and labels, with regularization to enforce code independence.
result DIMCO reduces overfitting and improves efficiency in few-shot classification.