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

1.0%1.9%2.9%3.8% · Mar 199519922001200920172026
48 results for Stack Overflow

Code search and comprehension have become more difficult in recent years due to the rapid expansion of available source code. Current tools lack a way to label arbitrary code at scale while maintaining up-to-date representations of new programming languages, libraries, and functionalities. Comprehensive labeling of sou…

2019-06-03abs ↗pdf ↗

Study investigates micro-event detection on FLOSS version releases from Stack Overflow.

problem Detecting micro-events in FLOSS version release events from textual messages.
method Developed pipelines using LDA topic modeling, hSBM topics, and sentiment analysis; optimized feature spaces with RFECV; evaluated models with statistical analysis.
result Found characteristic changes in topics or sentiment features before or after FLOSS version releases.

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 ↗

We present a semi-supervised learning algorithm for learning discrete factor analysis models with arbitrary structure on the latent variables. Our algorithm assumes that every latent variable has an "anchor", an observed variable with only that latent variable as its parent. Given such anchors, we show that it is possi…

2015-11-10abs ↗pdf ↗

People are increasingly relying on the Web and social media to find solutions to their problems in a wide range of domains. In this online setting, closely related problems often lead to the same characteristic learning pattern, in which people sharing these problems visit related pieces of information, perform almost …

2016-10-18abs ↗pdf ↗

Many time series are effectively generated by a combination of deterministic continuous flows along with discrete jumps sparked by stochastic events. However, we usually do not have the equation of motion describing the flows, or how they are affected by jumps. To this end, we introduce Neural Jump Stochastic Different…

2019-05-24abs ↗pdf ↗

Optimizes communication in federated learning using rate-distortion theory.

problem Reduces communication cost in federated learning while maintaining model accuracy.
method Applies rate-distortion theory to model updates, proposing distortion as a proxy for accuracy.
result Near-optimal communication reduction, outperforming other methods on a FL benchmark.

Learning from the crowd has become increasingly popular in the Web and social media. There is a wide variety of crowdlearning sites in which, on the one hand, users learn from the knowledge that other users contribute to the site, and, on the other hand, knowledge is reviewed and curated by the same users using assessm…

2016-12-14abs ↗pdf ↗

A framework to compare federated learning algorithms in high-dimensional settings.

problem Comparing the performance of federated learning algorithms in high-dimensional settings.
method Formulating federated learning as a multi-criterion objective and analyzing a linear regression model.
result Federated Averaging with simple client fine-tuning achieves the same asymptotic risk as more intricate approaches and outperforms without personalization.

WrapNet optimizes inference for low-resolution neural networks by using 8-bit additions.

problem Reducing multiplication complexity in low-resolution neural networks.
method Adapting neural networks to use low-resolution (8-bit) additions in accumulators, with a cyclic activation layer and overflow penalty regularizer.
result Achieves comparable classification accuracy to 32-bit counterparts using low-resolution additions.

Stacking is a general approach for combining multiple models toward greater predictive accuracy. It has found various application across different domains, ensuing from its meta-learning nature. Our understanding, nevertheless, on how and why stacking works remains intuitive and lacking in theoretical insight. In this …

2019-01-26abs ↗pdf ↗

We review the basic definition of a stack and apply it to the topological and smooth settings. We then address two subtleties of the theory: the correct definition of a ``stack over a stack'' and the distinction between small stacks (which are algebraic objects) and large stacks (which are generalized spaces).

2003-06-10abs ↗pdf ↗

In this article, we derive many properties of étale stacks in various contexts, and prove that étale stacks may be characterized categorically as those stacks that arise as prolongations of stacks on a site of spaces and local homeomorphisms. Moreover, we show that the bicategory of étale differentiable stacks and loca…

2012-12-11abs ↗pdf ↗

New neural stack and Turing Machine architectures prove stability and computational power.

problem Designing stable neural network architectures for Turing Machine simulation.
method Introducing neural stack and Turing Machine architectures, proving stability and computational equivalence.
result Differentiable nnTM with bounded neurons can simulate Turing Machine in real-time and is equivalent to UTM.

Bayesian stacking improves model performance with varying model weights.

problem Improving model predictions with heterogeneous input performance.
method Bayesian hierarchical stacking with varying model weights inferred via Bayesian inference.
result Hierarchical stacking yields better predictions than linear averaging.

We generalize the notion of a small sheaf of sets over a topological space or manifold to define the notion of a small stack of groupoids over an étale topological or differentiable stack. We then provide a construction analogous to the étalé space construction in this context, establishing an equivalence of 2-categori…

2010-11-28abs ↗pdf ↗

This work characterizes global quotient stacks---smooth stacks associated to a finite group acting a manifold---among smooth quotient stacks [M/G][M/G], where MM is a smooth manifold equipped with a smooth proper action by a Lie group GG. The characterization is described in terms of the action of the connected componen…

2013-02-02abs ↗pdf ↗

Constructs moduli stacks for quiver connections and extends non-Abelian Hodge theory.

problem Extending non-Abelian Hodge theory to moduli stacks of quiver connections.
method Formalizes and constructs moduli stacks of bundles with λ-connections over prestacks.
result Shows moduli stacks are algebraic and locally of finite presentation when base is smooth and projective.

Study connections on Lie groupoids and stacks using Atiyah sequences.

problem No specific problem stated; general connections on Lie groupoids and stacks.
method Construct connections using Atiyah sequences associated with transversal tangential distributions.
result Detailed study and construction of connections on Lie groupoids and stacks.

In this paper, we consider diffeological spaces as stacks over the site of smooth manifolds, as well as the "underlying" diffeological space of any stack. More precisely, we consider diffeological spaces as so-called concrete sheaves and show that the Grothendieck construction sending these sheaves to stacks has a left…

2014-06-05abs ↗pdf ↗

Constructs moduli stacks of quiver bundles and applies to Higgs bundles.

problem Classifying morphisms of vector bundles over a fixed base.
method General method for constructing moduli stacks of diagrams of vector bundles indexed by a simplicial set.
result Recovery of Nakajima quiver varieties and alternate construction of moduli stacks of Higgs bundles.

We study compositional generalization, viz., the problem of zero-shot generalization to novel compositions of concepts in a domain. Standard neural networks fail to a large extent on compositional learning. We propose Tree Stack Memory Units (Tree-SMU) to enable strong compositional generalization. Tree-SMU is a recurs…

2019-11-05abs ↗pdf ↗

New algorithm reduces costs and latency for large language model inference.

problem Optimizing inference costs and latency for large language models with GPU constraints.
method Formulated as an online scheduling problem with endogenous memory growth, introduced fluid model and WAIT algorithms.
result Reduced costs and latency, especially in near-overloaded and overloaded regimes.

This thesis is divided into four chapters. The first chapter discusses the relationship between stacks on a site and groupoids internal to the site. It includes a rigorous proof of the folklore result that there is an equivalence between the bicategory of internal groupoids and the bicategory of geometric stacks. The s…

2018-06-05abs ↗pdf ↗

Study moduli spaces of elliptic PDEs using derived CC^{\infty}-geometry.

problem Representability of moduli spaces of solutions of elliptic PDEs.
method Derived CC^{\infty}-geometry, stacks of relative jets, nonlinear Fredholm analysis.
result Moduli stack of solutions is relatively representable by quasi-smooth derived CC^{\infty}-schemes.

For a compact manifold M and a differentiable stack \cX presented by a Lie groupoid X, we show the Hom-stack Hom(M,\cX) is presented by a Fréchet-Lie groupoid Map(M,X) and so is an infinite-dimensional differentiable stack. We further show that if \cX is an orbifold, presented by a proper étale Lie groupoid, then Map(M…

2016-10-19abs ↗pdf ↗

We propose a novel stacked generalization (stacking) method as a dynamic ensemble technique using a pool of heterogeneous classifiers for node label classification on networks. The proposed method assigns component models a set of functional coefficients, which can vary smoothly with certain topological features of a n…

2016-10-16abs ↗pdf ↗

Paper proves stacking ensembling is effective and proposes a new family of stacked generalizations.

problem Lack of theoretical guarantees for stacking ensembling methods.
method Proves novel theoretical result and proposes a new family of stacked generalizations.
result Proves stacking ensembling is effective and proposes a new family of stacked generalizations.