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

Trend · papers per month

4999148197 · Jun 202019922001200920172026
48 results for analog coding

Optimizing over-the-air convex optimization, analog schemes are nearly optimal at low SNR.

problem Optimizing over-the-air convex optimization with coded gradients.
method Analyzes coded gradients over an additive Gaussian noise channel, considers analog coding schemes.
result Analog coding schemes nearly match the optimal convergence rate at low SNR, but a slowdown is inevitable.

Fault-tolerant neural networks inspired by biological error correction codes.

problem Achieving reliable computation with unreliable neurons.
method Using biological error correction codes from grid cells in the mammalian cortex to develop a fault-tolerant neural network.
result Noisy biological neurons operate below a fault-tolerance threshold, suggesting a mechanism for reliable computation in the brain.

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 ↗

We can define a neural network that can learn to recognize objects in less than 100 lines of code. However, after training, it is characterized by millions of weights that contain the knowledge about many object types across visual scenes. Such networks are thus dramatically easier to understand in terms of the code th…

2019-07-15abs ↗pdf ↗

We study the concept of a code (or shift) space for a generalized iterated function system (GIFS in short). We prove that relations between GIFSs and their code spaces are analogous to the case of classical IFSs. As an application, we consider the problem of connectedness of attractors of GIFSs. Many of our results are…

2013-10-11abs ↗pdf ↗

We propose a new method for learning word representations using hierarchical regularization in sparse coding inspired by the linguistic study of word meanings. We show an efficient learning algorithm based on stochastic proximal methods that is significantly faster than previous approaches, making it possible to perfor…

2014-06-08abs ↗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 ↗

Neural networks learn task-specific features, influenced by nonlinearity.

problem Understanding the nature of task-dependent feature learning in neural networks.
method Investigation of fully-connected, wide neural networks using Bayesian framework.
result The nature of internal representations depends on neuronal nonlinearity, leading to analog, redundant, or sparse coding schemes.

In many applications, it is desirable to extract only the relevant aspects of data. A principled way to do this is the information bottleneck (IB) method, where one seeks a code that maximizes information about a 'relevance' variable, Y, while constraining the information encoded about the original data, X. Unfortunate…

2016-05-24abs ↗pdf ↗

The restricted Boltzmann machine is a graphical model for binary random variables. Based on a complete bipartite graph separating hidden and observed variables, it is the binary analog to the factor analysis model. We study this graphical model from the perspectives of algebraic statistics and tropical geometry, starti…

2009-08-30abs ↗pdf ↗

Massive multiple-input multiple-output (MIMO) systems require downlink channel state information (CSI) at the base station (BS) to better utilize the available spatial diversity and multiplexing gains. However, in a frequency division duplex (FDD) massive MIMO system, CSI feedback overhead degrades the overall spectral…

2019-10-23abs ↗pdf ↗

Let XX be an irreducible smooth geometrically integral projective surface over a field. In this paper we give an effective bound in terms of the Neron--Severi rank ρ(X)ρ(X) of XX for the number of irreducible curves CC on XX with negative self-intersection and geometric genus less than b1(X)/4b_1(X)/4, where b1(X)b_1(X) is t…

2011-05-05abs ↗pdf ↗

This paper clarifies VAE's property through geometric and information-theoretic interpretations.

problem The transparency of VAE model is an underlying issue.
method Quantitative understanding of VAE through differential geometry and information theory.
result VAE can be mapped to an implicit isometric embedding with a scale factor derived from the posterior parameter.

Dropout is a popular regularization technique in deep learning. Yet, the reason for its success is still not fully understood. This paper provides a new interpretation of Dropout from a frame theory perspective. By drawing a connection to recent developments in analog channel coding, we suggest that for a certain famil…

2018-10-14abs ↗pdf ↗

This dissertation explores the integration of learning and analogy-making through the development of a computer program, called Analogator, that learns to make analogies by example. By "seeing" many different analogy problems, along with possible solutions, Analogator gradually develops an ability to make new analogies…

2020-01-18abs ↗pdf ↗

Analog forecasting uses local dynamics to predict chaotic systems.

problem Theoretical connections between analog forecasting and dynamical systems are overlooked.
method Local approximations of the system's dynamics, linear regression, and estimation of analog forecasting errors.
result Analog forecasting performances are highly linked to the local Jacobian matrix of the flow map.

ADR helps LLMs find and use historical analogies for foresight analysis.

problem LLMs struggle to find relevant historical analogies due to surface-level matching.
method Proposes CANA framework with mechanism alignment and cross-analogy confirmation.
result CANA improves historical analogy generation by up to 10%.

Analog methods improve forecast accuracy in complex models.

problem Improving forecast accuracy in complex models like Lorenz-96.
method Constructing analogs using variational autoencoders for ensemble data assimilation.
result Constructed analogs perform as well as a full ensemble square root filter.

The paper evaluates the probability distributions of analog-to-target distances for multiple analogs.

problem Understanding the performance of analog applications through the distribution of distances to target states.
method Theoretical analysis and numerical experiments using dynamical systems theory.
result The size of the catalog and dimensionality affect the probability distributions of the K-best analogs.

We consider the problem of developing suitable learning representations (embeddings) for library packages that capture semantic similarity among libraries. Such representations are known to improve the performance of downstream learning tasks (e.g. classification) or applications such as contextual search and analogica…

2019-03-27abs ↗pdf ↗

Many software analysis methods have come to rely on machine learning approaches. Code segmentation - the process of decomposing source code into meaningful blocks - can augment these methods by featurizing code, reducing noise, and limiting the problem space. Traditionally, code segmentation has been done using syntact…

2019-07-18abs ↗pdf ↗

Building on a specific formalization of analogical relationships of the form "A relates to B as C relates to D", we establish a connection between two important subfields of artificial intelligence, namely analogical reasoning and kernel-based machine learning. More specifically, we show that so-called analogical propo…

2019-01-07abs ↗pdf ↗

Analog method solves portfolio optimization problems faster and more efficiently.

problem Accurate covariance matrix estimation and fast optimal portfolio selection for financial applications.
method Two-step process using equilibrium propagation and analog Hopfield networks.
result Fully analog pipeline calculates optimal portfolios in energy-efficient manner.

The availability of large idea repositories (e.g., the U.S. patent database) could significantly accelerate innovation and discovery by providing people with inspiration from solutions to analogous problems. However, finding useful analogies in these large, messy, real-world repositories remains a persistent challenge …

2017-06-17abs ↗pdf ↗

Recent research in coarse geometry revealed similarities between certain concepts of analysis, large scale geometry, and topology. Property A of G.Yu is the coarse analog of amenability for groups and its generalization (exact spaces) was later strengthened to be the large scale analog of paracompact spaces using parti…

2012-08-13abs ↗pdf ↗

Contrastive Code Representation Learning improves code summarization and type inference.

problem Code representations are sensitive to edits, hindering downstream semantic understanding tasks.
method ContraCode: a contrastive pre-training task that learns code functionality.
result Contrastive pre-training improves code summarization and type inference accuracy.

Analog BNNs perform similarly regardless of noise distribution shape.

problem Difficulty in precisely controlling noise distribution shape in analog devices.
method Used real device noise as the variational distribution in MFVI training.
result Predictive distributions converge to the same distribution regardless of noise shape.

Deep-learning based classification algorithms have been shown to be susceptible to adversarial attacks: minor changes to the input of classifiers can dramatically change their outputs, while being imperceptible to humans. In this paper, we present a simple hypothesis about a feature compression property of artificial i…

2019-05-25abs ↗pdf ↗

Investigates neural codes and their embeddings, proving conjectures and introducing new code types.

problem Analyzing neural codes and their embedding dimensions.
method Combinatorial, topological, and algebraic analysis; proving conjectures; introducing new neural code types.
result Proves conjectures about neural codes and their embeddings, introduces new code types.

Characterization of a patient clinical phenotype is central to biomedical informatics. ICD codes, assigned to inpatient encounters by coders, is important for population health and cohort discovery when clinical information is limited. While ICD codes are assigned to patients by professionals trained and certified in c…

2018-11-28abs ↗pdf ↗