Bioinformatics tools have been developed to interpret gene expression data at the gene set level, and these gene set based analyses improve the biologists' capability to discover functional relevance of their experiment design. While elucidating gene set individually, inter gene sets association is rarely taken into co…
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,742 papers · 148 categories
Trend · papers per month
36 results for “superset”
NIST CTS Superset offers a large dataset for telephony speaker recognition.
problem Lack of a large-scale, uniform dataset for telephony speaker recognition.
method Compilation of speech segments from multiple corpora, including Greybeard, Switchboard, and Mixer series.
result Results on the NIST 2020 CTS Speaker Recognition Challenge serve as a reference baseline.
PCGs encompass a broader range of neural networks.
problem Understanding the broader scope of neural network models.
method Proving PCGs as a superset of feedforward neural networks.
result PCGs represent a wider class of neural network models.
Screening is the problem of finding a superset of the set of non-zero entries in an unknown p-dimensional vector β* given n noisy observations. Naturally, we want this superset to be as small as possible. We propose a novel framework for screening, which we refer to as Multiple Grouping (MuG), that groups variables, pe…
Study modular concept learning with different oracle interfaces.
problem Learning a concept that is a cross product of component concepts.
method Analyze different types of oracle interfaces and queries.
result Modular concept learning is easier with positive examples and membership queries.
Motivated by applications in Optimization, Game Theory, and the training of Generative Adversarial Networks, the convergence properties of first order methods in min-max problems have received extensive study. It has been recognized that they may cycle, and there is no good understanding of their limit points when they…
Unified framework for learning with indirect supervision signals.
problem Learning from indirect supervision signals when gold labels are missing or costly.
method Developed a unified theoretical framework for multi-class classification with variable supervision.
result Introduced the concept of separation to characterize learnability and generalization bounds.
Cable knots are not thinmath.GT
Using the Bordered Floer theory of Lipshitz-Ozsváth-Thurston we prove that the -cables of any non-trivial knots are not Heegaard Floer homologically thin. Using the proof and a theorem of Zemke, we find a larger set of satellite knots which is a proper superset of the set of all cable knots, having the same prop…
GFlowNet Foundationscs.LG
GFlowNets sample diverse candidates in active learning.
problem Sampling diverse candidates in active learning.
method Generative Flow Networks (GFlowNets) for proportional sampling.
result GFlowNets estimate joint and marginal distributions.
Improved self-supervised learning using credal sets.
problem Lack of precise knowledge in pseudo-labels.
method Using credal sets (sets of probability distributions) for labeling unlabeled data.
result Competitive to superior performance in low-label scenarios.
We present a novel method that can learn a graph representation from multivariate data. In our representation, each node represents a cluster of data points and each edge represents the subset-superset relationship between clusters, which can be mutually overlapped. The key to our method is to use formal concept analys…
In this paper we study predictive pattern mining problems where the goal is to construct a predictive model based on a subset of predictive patterns in the database. Our main contribution is to introduce a novel method called safe pattern pruning (SPP) for a class of predictive pattern mining problems. The SPP method a…
Paper tackles causal effect estimation in observational data with hidden variables.
problem Estimating causal effects in observational data with hidden confounders.
method Developed a theorem for local search to find superset of adjustment variables, proposing a data-driven algorithm.
result Proposed algorithm produces more accurate causal effect estimates than existing methods.
This paper improves support recovery in universal one-bit compressed sensing.
problem Support recovery in one-bit compressed sensing for sparse signals.
method Proposes approximate support recovery and superset recovery algorithms with polynomial-time complexity.
result Achieves improved support recovery with fewer measurements compared to existing methods.
Paper improves conformal prediction for imprecise training data.
problem Applying conformal prediction to partially labeled data.
method Generalizes conformal prediction for set-valued training and calibration data.
result Validates the proposed method and shows it outperforms baselines.
Training of the neural autoregressive density estimator (NADE) can be viewed as doing one step of probabilistic inference on missing values in data. We propose a new model that extends this inference scheme to multiple steps, arguing that it is easier to learn to improve a reconstruction in steps rather than to lea…
Relation extraction aims to extract relational facts from sentences. Previous models mainly rely on manually labeled datasets, seed instances or human-crafted patterns, and distant supervision. However, the human annotation is expensive, while human-crafted patterns suffer from semantic drift and distant supervision sa…
This paper is a further extension of the method proposed in Itkin, 2014 as applied to another set of jump-diffusion models: Inverse Normal Gaussian, Hyperbolic and Meixner. To solve the corresponding PIDEs we accomplish few steps. First, a second-order operator splitting on financial processes (diffusion and jumps) is …
This paper details the techniques and algorithms implemented in Kahler, a Python library that implements discrete exterior calculus on arbitrary Hermitian manifolds. Borrowing techniques and ideas first implemented in PyDEC, Kahler provides a uniquely general framework for computation using discrete exterior calculus. …
We propose a new, unified approach to solving jump-diffusion partial integro-differential equations (PIDEs) that often appear in mathematical finance. Our method consists of the following steps. First, a second-order operator splitting on financial processes (diffusion and jumps) is applied to these PIDEs. To solve the…
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…
The majority of ML research concerns slow, statistical learning of i.i.d. samples from large, labelled datasets. Animals do not learn this way. An enviable characteristic of animal learning is `episodic' learning - the ability to memorise a specific experience as a composition of existing concepts, after just one exper…
We propose in this paper a general framework for deriving loss functions for structured prediction. In our framework, the user chooses a convex set including the output space and provides an oracle for projecting onto that set. Given that oracle, our framework automatically generates a corresponding convex and smooth l…
It is notoriously difficult to control the behavior of reinforcement learning agents. Agents often learn to exploit the environment or reward signal and need to be retrained multiple times. The multi-objective reinforcement learning (MORL) framework separates a reward function into several objectives. An ideal MORL age…
New algorithm computes flag mean and median on flag manifolds.
problem Computing first order flag statistics on flag manifolds.
method Transformed problem to Stiefel manifold for optimization.
result Proved convergence and effectiveness of the flag-mean computation.
New method detects adversarial attacks in industrial systems.
problem Adversarial attacks compromise machine learning models in industrial control systems.
method Introduces domain adaptation layer and Monte Carlo simulation for proactive defense.
result Approximates Bayes optimal mitigation for improved detection model health.
VAEs struggle with low-dimensional data; this paper shows they can learn the correct manifold.
problem Training VAEs on low-dimensional data.
method Two-stage training algorithm based on conjecture of 0 variance generator.
result VAEs can learn generators with support equal to the ground truth manifold.
Predictive coding networks use inference learning for efficient AI modeling.
problem Traditional AI methods struggle with complex neural patterns.
method Inference learning for hierarchical Bayesian inference models.
result PCNs outperform traditional BP methods in efficiency and flexibility.
New datasets improve fairness research by revealing UCI Adult's limitations.
problem Limitations of UCI Adult dataset in fairness research.
method Reconstructed a superset of UCI Adult data from US Census sources.
result New datasets reveal trade-offs between fairness criteria and performance.
An undirected graphical model is a joint probability distribution defined on an undirected graph G*, where the vertices in the graph index a collection of random variables and the edges encode conditional independence relationships among random variables. The undirected graphical model selection (UGMS) problem is to es…
Efficient algorithms learn causal graphs with minimal interventions.
problem Learning causal relationships between observed variables in the presence of latents.
method Bi-criteria approximation goal combining intervention design and graph property testing.
result Achieve intervention cost within a small constant factor of the optimal.
This paper considers the multi-task learning problem and in the setting where some relevant features could be shared across few related tasks. Most of the existing methods assume the extent to which the given tasks are related or share a common feature space to be known apriori. In real-world applications however, it i…
Method identifies unknown intervention targets in structural causal models from diverse data.
problem Identifying unknown intervention targets in structural causal models from heterogeneous data.
method Two-phase approach: first recovers exogenous noises, second matches with endogenous variables.
result Proposed method uniquely identifies intervention targets under causal sufficiency assumption.
Nowozin \textit{et al} showed last year how to extend the GAN \textit{principle} to all -divergences. The approach is elegant but falls short of a full description of the supervised game, and says little about the key player, the generator: for example, what does the generator actually converge to if solving the GAN…
Study examines herding behavior in stocks, US ETFs, and cryptocurrencies.
problem Understanding herding behavior in different types of investment vehicles.
method Cross-sectional Absolute Deviation model, Minimum Spanning Tree, Louvain community detection.
result Herding behavior exists at all times across all types of investment vehicles at a subset level.
Recently proposed adversarial training methods show the robustness to both adversarial and original examples and achieve state-of-the-art results in supervised and semi-supervised learning. All the existing adversarial training methods consider only how the worst perturbed examples (i.e., adversarial examples) could af…