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.
New algorithm optimizes Hölder continuous functions efficiently.
Efficient algorithm for global optimization of multivariate Lipschitz functions.
The growth of the modern knowledge-based economy is becoming less and less dependent on tangible assets and more on intangible ones. In this context, the role of human capital in the value creation process has become central. Despite the large amount of scientific work on human capital phenomena, little research has re…
This review is about the convenience, the benefits, as well as the destructive capacities of money. It deals with various aspects of money creation, with its value, and its appropriation. All sorts of money tend to get corrupted by eventually creating too much of them. In the long run, this renders money worthless and …
ReSkill reconciles RL skill creation with policy optimization.
New KD-tree based method for private synthetic data generation.
New optimal transport method handles mass creation and destruction.
Designing AI market for content creation
Proposes a model to optimize feedback for content creators on social media.
This research creates and classifies datasets for Setswana and Sepedi news headlines.
This paper gives an overview of several key innovations in the 19th century which led to complex geometry in the 20th century. This includes the creation of the complex plane, the work of Abel on addition theorems for generalized elliptic integrals, the theory of elliptic functions, holomorphic functions, and the creat…
We study the possibility of completing data bases of a sample of governance, diversification and value creation variables by providing a well adapted method to reconstruct the missing parts in order to obtain a complete sample to be applied for testing the ownership-structure/diversification relationship. It consists o…
The extremely useful method of Malliavin calculus has not yet gained adequate popularity because of the complicated analytic apparatus of this method. The author attempts here to propose a simplified algebraic formalism similar to Malliavin calculus, but based on the notion of creation-annihilation operators instead of…
Model explains money creation under regulatory constraints.
Solve Painleve VI to relate instanton bundles.
Solves TOD systems' query annotation problem without explicit annotations.
Study exact community recovery in noisy SBM with limited queries.
[Context:] Model-based testing is an instrument for automated generation of test cases. It requires identifying requirements in documents, understanding them syntactically and semantically, and then translating them into a test model. One light-weight language for these test models are Cause-Effect-Graphs (CEG) that ca…
Improves labeling quality in machine learning with pairwise feedback.
Efficiently classifies binary labels with XOR queries, even under noisy conditions.
Proposes a new query autocompletion method that maximizes retrieval performance.
Adapts large transformer model for search query intent understanding.
A new method for private query release using Johnson-Lindenstrauss projection.
LAZO reduces query complexity and variance in ZO methods.
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.
Query2box embeds complex queries as boxes to handle logical operations in large KGs.
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…
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 …
The basic financial purpose of corporation is creation of its value. Liquidity management should also contribute to realization of this fundamental aim. Many of the current asset management models that are found in financial management literature assume book profit maximization as the basic financial purpose. These boo…
A new query embedding method improves KB performance on complex queries.
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…
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.
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…
Improves model classification accuracy in black-box settings.
Improved algorithm for selecting a hypothesis locally privately with fewer queries.
Discrete integration in a high dimensional space of n variables poses fundamental challenges. The WISH algorithm reduces the intractable discrete integration problem into n optimization queries subject to randomized constraints, obtaining a constant approximation guarantee. The optimization queries are expensive, which…
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. We consider three extensions of this fundamental problem that are motivated by practical considerations in real-world, time-critical identification tasks such as emergency…
This paper presents thirteen datasets for binary, multiclass and multilabel classification based on the European Court of Human Rights judgments since its creation. The interest of such datasets is explained through the prism of the researcher, the data scientist, the citizen and the legal practitioner. Contrarily to m…