Method selects valid IVs from a large set using clustering and test of overidentifying restrictions.
problem Selecting valid instrumental variables from a large set of candidates.
method Agglomerative hierarchical clustering combined with a test of overidentifying restrictions.
result Achieves oracle properties when the largest group of IVs is valid.
ZNet learns instrumental representations from covariates for causal inference.
problem Lack of valid instruments in observational studies.
method Representation learning approach that constructs instrumental representations from observed covariates.
result ZNet enables IV-based estimation without explicit instruments.
Valid causal inference with invalid instruments using majority or modal valid relationships.
problem Estimating causal effects in the presence of unobserved confounding and invalid instruments.
method Ensemble of instrumental variable estimators to estimate the modal prediction, achieving accurate estimates of conditional average treatment effects.
result Valid causal inference can be achieved with a majority or modal valid instrument-response relationship.
Research quantifies financial exclusion risks in UK, focusing on cash infrastructure and socio-economic factors.
problem Localised financial exclusion in the UK as cash infrastructure declines.
method Developed a composite indicator using various input variables.
result Financial exclusion is more prevalent in deprived communities and affluent areas.
Many practical applications such as gene expression analysis, multi-task learning, image recognition, signal processing, and medical data analysis pursue a sparse solution for the feature selection purpose and particularly favor the nonzeros \emph{evenly} distributed in different groups. The exclusive sparsity norm has…
Introduces joint exclusivity (JE), a new form of negative dependence.
problem Negative dependence structures in probability distributions.
method Defines JE by exclusion of the interior of the non-negative orthant, establishes necessary and sufficient conditions for existence, proposes a canonical construction.
result Sharp necessary and sufficient condition for existence of JE random vectors with prescribed marginals.
We consider the symmetric exclusion process on suitable random grids that approximate a compact Riemannian manifold. We prove that a class of random walks on these random grids converge to Brownian motion on the manifold. We then consider the empirical density field of the symmetric exclusion process and prove that it …
NTL protects AI models by restricting their generalization ability to specific domains.
problem Protecting AI models as intellectual property in a secure and robust manner.
method Non-Transferable Learning (NTL) captures exclusive data representation and restricts model generalization ability.
result NTL provides robust resistance to watermark removal and data-centric protection for usage authorization.
Extends conformal prediction to contrastive learning for better coverage of positive samples.
problem Lack of principled guarantees on coverage in contrastive learning.
method Introduces minimum-volume covering sets with learnable constraints.
result Improves inclusion-exclusion trade-offs in positive and negative samples.
Log-conformal projective pairs restrict to simple geometric structures.
problem Characterizing pairs of projective manifolds with logarithmic conformal tensors.
method Analyzing the nefness and triviality of KX+Δ to deduce geometric properties. result Pairs of projective manifolds with logarithmic conformal tensors are restricted to simple geometric structures.
Exclusive Group Lasso improves feature selection in correlated biological data.
problem Correlated features hinder Lasso performance in biological classification problems.
method Proposes and solves the exclusive group Lasso, combining stability selection and random group allocation.
result Exclusive Group Lasso outperforms Lasso in comprehensive selection of informative features.
Exclusive Lasso improves survival prediction in cancer datasets.
problem Enhanced survival prediction in cancer datasets with high-dimensional genomic and clinical data.
method Proposes Exclusive Lasso regularization for feature selection in Cox regression models for grouped variables.
result Demonstrates improved survival prediction performance using Exclusive Lasso compared to standard Cox regression.
New method selects variables in groups with few nonzeros, improving support recovery.
problem Structured variable selection with sparse patterns across groups.
method Composite norm and proximal algorithm for exclusive group sparsity.
result Asymptotic consistency in signed support recovery under conventional assumptions.
The paper proposes a model to learn disentangled representations using mutual information.
problem Learning disentangled representations from shared and exclusive attributes.
method Mutual information maximization for shared attributes and minimization for disentanglement.
result The proposed model outperforms state-of-the-art models in representation disentanglement.
ETM identifies field-specific keywords in text classification.
problem Unsupervised text classification with field-specific keywords.
method Weighted Lasso penalty and pairwise Kullback-Leibler divergence penalty for topic separation.
result ETM improves topic coherence by 22% and 10% compared to LDA.
An exclusion particle model is considered as a highly simplified model of a limit order market. Its price behavior reproduces the well known crossover from over-diffusion (Hurst exponent H>1/2) to diffusion (H=1/2) when the time horizon is increased, provided that orders are allowed to be canceled. For early times a ma…
Paper adapts CVS method for TL in functional linear regression.
problem Improving estimation and prediction in scalar-on-function regression.
method Adapts control variates method for transfer learning.
result Establishes theoretical connection between O-TL and CVS-based TL.
Negative screening is one method to avoid interactions with inappropriate entities. For example, financial institutions keep investment exclusion lists of inappropriate firms that have environmental, social, and government (ESG) problems. They create their investment exclusion lists by gathering information from variou…
Spaces of polynomials are shown to be Euclidean balls.
problem Understanding the geometry of Lorentzian and real stable polynomials.
method Refined connection between symmetric exclusion process and polynomial geometry.
result Spaces of Lorentzian and real stable polynomials are homeomorphic to closed Euclidean balls.
New method for personalized pricing using invalid instrumental variables.
problem Personalized pricing under endogeneity with limited standard methods.
method PRINT method for continuous treatment, solving conditional moment restrictions.
result Established optimal pricing strategy under endogeneity with invalid instrumental variables.
New study analyzes security of neural network data reconstruction attacks.
problem Data reconstruction attacks pose a threat to private training data.
method Analyzes security boundary of data reconstruction attacks via neuron exclusivity state.
result Characterizes insecure/secure boundary of data reconstruction attacks.
An ongoing challenge in the analysis of document collections is how to summarize content in terms of a set of inferred themes that can be interpreted substantively in terms of topics. The current practice of parametrizing the themes in terms of most frequent words limits interpretability by ignoring the differential us…
Unsupervised learning is becoming more and more important recently. As one of its key components, the autoencoder (AE) aims to learn a latent feature representation of data which is more robust and discriminative. However, most AE based methods only focus on the reconstruction within the encoder-decoder phase, which ig…
GRAND ensures node-level differential privacy for network data.
problem Lack of node-level differential privacy for network data.
method Proposes GRAND, the first mechanism for releasing networks with node-level differential privacy and preserving structural properties.
result GRAND releases networks while ensuring node-level differential privacy and preserving structural properties.
Method estimates treatment effect bounds in sample selection models.
problem Estimating heterogeneous treatment effects in presence of sample selection.
method Debiased/double machine learning approach for non-linear and high-dimensional confounders.
result Substantially tighter effect bounds for younger users.
Goals for reinforcement learning problems are typically defined through hand-specified rewards. To design such problems, developers of learning algorithms must inherently be aware of what the task goals are, yet we often require agents to discover them on their own without any supervision beyond these sparse rewards. W…
Being able to model correlations between labels is considered crucial in multi-label classification. Rule-based models enable to expose such dependencies, e.g., implications, subsumptions, or exclusions, in an interpretable and human-comprehensible manner. Albeit the number of possible label combinations increases expo…
Paper analyzes and improves GPSP algorithm for block sparse signal recovery.
problem Recovering block sparse signals from noisy data.
method Group Projected Subspace Pursuit (GPSP) with convergence analysis and feature selection criteria.
result GPSP exactly recovers true block sparse signals under certain conditions.
Study non-negative curvature Markov chains, proving entropy contraction.
problem Prove entropy contraction for Markov chains with non-negative curvature.
method Prove 1-step contraction in Wasserstein distance implies 1-step contraction in relative entropy.
result Prove MLSI with constant equal to minimal rate increment for mean-field zero-range process.
Analyzes how inclusion/exclusion from STOXX Europe 600 Index affects company prices.
problem Understanding price dynamics of companies in STOXX Europe 600 Index.
method Used logit models and neural networks to analyze data.
result Identified independent variables affecting price changes.
Study risk-constrained Kelly optimization for mutually exclusive outcomes, proving support invariance and developing a structured algorithm.
problem Risk-constrained Kelly optimization for mutually exclusive outcomes with explicit state prices.
method Analyzes the finite mutually exclusive outcome version of risk-constrained Kelly optimization with explicit state prices, proving support invariance and developing a structured algorithm.
result Support is invariant across CRRA parameter and drawdown-surrogate parameter in the overround regime.
Study of SO(3)-irreducible geometry in complex 5D and ternary Pauli exclusion principle.
problem Exploring SO(3)-irreducible geometry in complex 5D.
method Defined a ternary skew-symmetric tensor, split the 10D space into irreducible SO(3) subspaces, found invariants and defined geometric structures.
result Defined a SO(3)-irreducible geometric structure on a 5D complex Hermitian manifold.
In this paper we consider the problem of semi-supervised learning with deep Convolutional Neural Networks (ConvNets). Semi-supervised learning is motivated on the observation that unlabeled data is cheap and can be used to improve the accuracy of classifiers. In this paper we propose an unsupervised regularization term…
Meta-learning improved by using information theory to prioritize data-driven adaptation.
problem Challenges in meta-learning due to the need for mutually-exclusive tasks.
method Designing a meta-regularization objective using information theory.
result Successfully uses data from non-mutually-exclusive tasks to efficiently adapt to novel tasks.
The availability of large microarray data has led to a growing interest in biclustering methods in the past decade. Several algorithms have been proposed to identify subsets of genes and conditions according to different similarity measures and under varying constraints. In this paper we focus on the exclusive row bicl…
Hexagonal norm double bubble problem solved with minimal configurations.
problem Finding the optimal shapes for minimizing perimeter in hexagonal geometry.
method Elementary proof and geometric exclusions to simplify minimizer search.
result Existence of minimizing sets for volume ratio parameter α in (0,1].
The exclusive or (xor) function is one of the simplest examples that illustrate why nonlinear feedforward networks are superior to linear regression for machine learning applications. We review the xor representation and approximation problems and discuss their solutions in terms of probabilistic logic and associative …
AI uses language models to find instrumental variables quickly.
problem Finding valid instrumental variables is a challenging and heuristic process.
method Uses large language models to search for new instrumental variables through narratives and counterfactual reasoning.
result Demonstrates the effectiveness of multi-step and role-playing prompting strategies for LLMs.
Continuing the quest for exclusive Racah matrices, which are needed for evaluation of colored arborescent-knot polynomials in Chern-Simons theory, we suggest to extract them from a new kind of a double-evolution -- that of the antiparallel double-braids, which is a simple two-parametric family of two-bridge knots, gene…
The paper proposes an iterative approach to batch reinforcement learning for safer and more informative data collection.
problem Learning policies that are too rigid and do not adapt to new data.
method Safe diversified model-based policy search in an iterative batch reinforcement learning framework.
result Improved learned policies through continuous data collection and adaptation.
Semi-supervised learning is sought for leveraging the unlabelled data when labelled data is difficult or expensive to acquire. Deep generative models (e.g., Variational Autoencoder (VAE)) and semisupervised Generative Adversarial Networks (GANs) have recently shown promising performance in semi-supervised classificatio…
Interventional cancer clinical trials are generally too restrictive, and some patients are often excluded on the basis of comorbidity, past or concomitant treatments, or the fact that they are over a certain age. The efficacy and safety of new treatments for patients with these characteristics are, therefore, not defin…
Mapping spaces of supermanifolds are usually thought as exclusively in functorial terms (i.e. trough the Grothendieck functor of points). In this work we provide a geometric description of such mapping spaces in terms of infinite-dimensional super-vector bundles.
It is well known that a random vector with given marginal distributions is comonotonic if and only if it has the largest sum with respect to the convex order [ Kaas, Dhaene, Vyncke, Goovaerts, Denuit (2002), A simple geometric proof that comonotonic risks have the convex-largest sum, ASTIN Bulletin 32, 71-80. Cheung (2…
New method discovers causal relationships in complex time series data.
problem Discovering causal relationships in multivariate time series is challenging.
method Temporal Dependency to Causality (TD2C) framework using mutual information.
result TD2C achieves state-of-the-art performance in causal discovery.
PieClam autoencodes graphs into communities, improving graph anomaly detection.
problem Graph anomaly detection and universal graph autoencoding.
method Probabilistic graph model with overlapping inclusive and exclusive communities.
result PieClam is a universal autoencoder that uniformly approximates any graph.
Aggregation challenges causal interpretation of IV estimators.
problem Aggregation of fine-grained components into an aggregate treatment variable.
method Characterization of conditions for identifying aggregate causal effects.
result Standard IV estimators cannot identify aggregate causal effects due to ambiguous dependencies.
Contrastive regularization improves semi-supervised learning by better propagating confident pseudo-labels.
problem Consistency regularization's limitation in high performance and efficiency.
method Proposes contrastive regularization to update model features, pushing confident labels into unlabeled samples.
result Improves semi-supervised learning tasks with fewer training iterations and robust performance.