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.
Study reduces memory needs for active learning with enriched queries.
Framework for few-shot relation classification with minimal training data.
Popular online enrichment analysis tools from the field of molecular systems biology provide users with the ability to submit their experimental results as gene sets for individual analysis. Such queries are kept private, and have never before been considered as a resource for integrative analysis. By harnessing gene s…
We define a symmetric monoidal (4,3)-category with duals whose objects are certain enriched multi-fusion categories. For every modular tensor category , there is a self enriched multi-fusion category giving rise to an object of this symmetric monoidal (4,3)-category. We conjecture that the e…
DS2CF-Net learns hierarchical representations with deep coupled factorization and enriched prior.
In this paper we analyze supergeometric locally covariant quantum field theories. We develop suitable categories SLoc of super-Cartan supermanifolds, which generalize Lorentz manifolds in ordinary quantum field theory, and show that, starting from a few representation theoretic and geometric data, one can construct a f…
FEM improves attention mechanisms by applying value-driven log-linear tilts.
Cross-domain collaborative filtering (CF) aims to alleviate data sparsity in single-domain CF by leveraging knowledge transferred from related domains. Many traditional methods focus on enriching compared neighborhood relations in CF directly to address the sparsity problem. In this paper, we propose superhighway const…
This paper evaluates data enrichment techniques for rare event detection in manufacturing.
KANEL combines models for early hit enrichment in virtual screening.
This note compares two recently published machine learning methods for constructing flexible, but tractable families of variational hidden-variable posteriors. The first method, called "hierarchical variational models" enriches the inference model with an extra variable, while the other, called "auxiliary deep generati…
A new method for virtual drug screening detects top treatments.
Variational autoencoders are powerful algorithms for identifying dominant latent structure in a single dataset. In many applications, however, we are interested in modeling latent structure and variation that are enriched in a target dataset compared to some background---e.g. enriched in patients compared to the genera…
The Lax-Hopf formula simplifies the value function of an intertemporal optimization (infinite dimensional) problem associated with a convex transaction-cost function which depends only on the transactions (velocities) of a commodity evolution: it states that the value function is equal to the marginal fonction of a fin…
Geometric problems are usually formulated by means of (exterior) differential systems. In this theory, one enriches the system by adding algebraic and differential constraints, and then looks for regular solutions. Here we adopt a dual approach, which consists to enrich a plane field, as this is often practised in cont…
Improves neural network performance by enriching training dataset.
Paper proposes a method to recover accurate labels from partially valid data in multi-label learning.
Paper reviews neurolinguistics and language technologies, emphasizing mutual enrichment.
Solves TOD systems' query annotation problem without explicit annotations.
Flowification enriches neural networks with an inverse pass and likelihood monitoring.
Study exact community recovery in noisy SBM with limited queries.
Enhances LLMs for predicting stock movements by considering news dissemination and context.
Proposes a new query autocompletion method that maximizes retrieval performance.
A new method for private query release using Johnson-Lindenstrauss projection.
LAZO reduces query complexity and variance in ZO methods.
We consider a query-based data acquisition problem for binary classification of unknown labels, which has diverse applications in communications, crowdsourcing, recommender systems and active learning. To ensure reliable recovery of unknown labels with as few number of queries as possible, we consider an effective quer…
We consider the problem of adaptively PAC-learning a probability distribution 's mode by querying an oracle for information about a sequence of i.i.d. samples generated from . We consider two different query models: (a) each query is an index for which the oracle reveals…
Estimates heavy hitters in data streams with queries, balancing accuracy and efficiency.
Enhanced tree-based classifiers use derivatives and geometry for better function classification.
Survey of statistical queries and their applications.
We study the query complexity of a learner-private sequential learning problem, motivated by the privacy and security concerns due to eavesdropping that arise in practical applications such as pricing and Federated Learning. A learner tries to estimate an unknown scalar value, by sequentially querying an external datab…
BioBO optimizes gene perturbation design using Bayesian optimization with biological priors.
Source coding is the canonical problem of data compression in information theory. In a locally encodable source coding, each compressed bit depends on only few bits of the input. In this paper, we show that a recently popular model of semi-supervised clustering is equivalent to locally encodable source coding. In this …
A new query embedding method improves KB performance on complex queries.
Answering complex logical queries on large-scale incomplete knowledge graphs (KGs) is a fundamental yet challenging task. Recently, a promising approach to this problem has been to embed KG entities as well as the query into a vector space such that entities that answer the query are embedded close to the query. Howeve…
In this paper we study the adaptive learnability of decision trees of depth at most from membership queries. This has many applications in automated scientific discovery such as drugs development and software update problem. Feldman solves the problem in a randomized polynomial time algorithm that asks $\tilde O(2^…
We study black-box attacks on machine learning classifiers where each query to the model incurs some cost or risk of detection to the adversary. We focus explicitly on minimizing the number of queries as a major objective. Specifically, we consider the problem of attacking machine learning classifiers subject to a budg…
Fairly allocate items with noisy queries, reducing envy.
This paper models the crowdsourced labeling/classification problem as a sparsely encoded source coding problem, where each query answer, regarded as a code bit, is the XOR of a small number of labels, as source information bits. In this paper we leverage the connections between this problem and well-studied codes with …
In query learning, the goal is to identify an unknown object while minimizing the number of "yes" or "no" questions (queries) posed about that object. A well-studied algorithm for query learning is known as generalized binary search (GBS). We show that GBS is a greedy algorithm to optimize the expected number of querie…
Regression, unlike classification, has lacked a comprehensive and effective approach to deal with cost-sensitive problems by the reuse (and not a re-training) of general regression models. In this paper, a wide variety of cost-sensitive problems in regression (such as bids, asymmetric losses and rejection rules) can be…
We introduce new combinatorial quantities for concept classes, and prove lower and upper bounds for learning complexity in several models of query learning in terms of various combinatorial quantities. Our approach is flexible and powerful enough to enough to give new and very short proofs of the efficient learnability…
The paper tackles learning smooth distance functions using query-based methods.
Understanding search queries is critical for shopping search engines to deliver a satisfying customer experience. Popular shopping search engines receive billions of unique queries yearly, each of which can depict any of hundreds of user preferences or intents. In order to get the right results to customers it must be …
Efficiently tests two distributions with few label queries.
We study the query complexity of Bayesian Private Learning: a learner wishes to locate a random target within an interval by submitting queries, in the presence of an adversary who observes all of her queries but not the responses. How many queries are necessary and sufficient in order for the learner to accurately est…
This work sets lower bounds on the number of score queries needed for diffusion sampling.
Most content-based image retrieval systems consider either one single query, or multiple queries that include the same object or represent the same semantic information. In this paper we consider the content-based image retrieval problem for multiple query images corresponding to different image semantics. We propose a…