CDPA identifies common and distinctive patterns in high-dimensional datasets.
problem Existing methods fail to capture the common pattern between coefficient matrices of shared latent factors.
method Proposes CDPA, an unsupervised learning method that incorporates both common and distinctive patterns of coefficient matrices.
result CDPA provides better characterization of common and distinctive patterns in high-dimensional datasets.
Study finds stocks with common firm fears earn lower returns.
problem Identifying and quantifying firm-level investor fears.
method Analysis of equity options to identify common firm-level fears and their impact on stock returns.
result Stocks with exposure to common bad fears earn lower returns and require higher compensation.
Neural story generation gains common sense through targeted training.
problem Lack of common sense reasoning in neural-generated stories.
method Multi-task learning with auxiliary datasets for common sense grounding.
result Improved common sense reasoning and state-of-the-art perplexity.
Study shows adversarial robustness and common perturbation robustness are independent.
problem Understanding the relationship between adversarial robustness and common perturbation robustness in neural networks.
method Conducted experiments to benchmark neural network robustness to common perturbations and adversarial examples.
result Adversarial robustness and common perturbation robustness are independent attributes.
A new model generates samples with a succinct common representation using Wyner's common information.
problem Generating samples with a succinct common representation.
method Proposes a variational Wyner model trained to minimize symmetric Kullback-Leibler divergence with regularization terms.
result Demonstrates utility through joint and conditional generation experiments.
New algorithm reduces MFGs with common noise complexity.
problem Prohibitive computational cost in solving MFGs with common noise.
method Signatured deep fictitious play based on rough path theory.
result Significantly reduced computational complexity and improved efficiency.
Proves common stellar subdivisions for all PL homeomorphic polyhedra.
problem Proving common stellar subdivisions for all PL homeomorphic polyhedra.
method Proved weighted strong factorization conjecture and iterated blowups.
result Every two PL homeomorphic polyhedra have a common stellar subdivision.
New method detects latent common causes from observational data.
problem Detecting latent common causes in observational data.
method Modified causal discovery algorithms to detect latent common causes.
result Successfully detects latent common causes in various noise regimes and real data.
MCCA extracts shared structure from multiple tensor datasets.
problem Extracting shared structure from multiple tensor datasets.
method Multilinear common component analysis (MCCA) using Kronecker products of mode-wise covariance matrices.
result MCCA constructs a common basis that retains information from multiple tensor datasets.
New method identifies common cause in causal insufficiency, revealing complex phase transitions.
problem Identifying common cause in causal insufficiency with observed joint probability.
method Generalized maximum likelihood method, closely related to maximum entropy principle.
result Identifies consistent common cause that aligns with the common cause principle.
Existence of strong randomized equilibria in mean-field games with common noise.
problem Existence of strong solutions in mean-field games of optimal stopping.
method Connection with Bank-El Karoui's representation problem and continuity assumptions.
result Existence of strong randomized mean-field equilibrium under certain conditions.
Paper addresses unbalanced data in common shock models for loss reserving.
problem Complications in capturing structural dependence with unbalanced data.
method Introduces a common shock Tweedie approach for unbalanced data.
result Better balance of common shock proportions and parsimonious solution.
Study shows foreign institutional investment increases liquidity commonality in large Australian stocks.
problem Impact of foreign institutional investment on liquidity commonality in Australian stocks.
method Cross-sectional and time-series analysis of Australian equity market data.
result Foreign institutional investment contributes to increased exposure of large stocks to unexpected liquidity events.
The stock market has been known to form homogeneous stock groups with a higher correlation among different stocks according to common economic factors that influence individual stocks. We investigate the role of common economic factors in the market in the formation of stock networks, using the arbitrage pricing model …
Two complexes share a common covering but not a finite one.
problem Common covering of complexes with specific properties.
method Constructing CW-complexes K and L with a common covering.
result K is homeomorphic to a complex with a single 2-cell.
CSD learns a common component for domain generalization, outperforming existing methods.
problem Training models to generalize across unseen domains.
method CSD decomposes the model into a common and specific component, discarding the latter.
result CSD outperforms state-of-the-art domain generalization methods.
The so called "globalization" process (i.e. the inexorable integration of markets, currencies, nation-states, technologies and the intensification of consciousness of the world as a whole) has a behavior exactly equivalent to a system that is tending to a maximum entropy state. This globalization process obeys a collec…
We study the problem of discovering the simplest latent variable that can make two observed discrete variables conditionally independent. The minimum entropy required for such a latent is known as common entropy in information theory. We extend this notion to Renyi common entropy by minimizing the Renyi entropy of the …
Framework for robust control in cooperative systems with uncertain common noise.
problem Optimizing collective behavior of agents in the presence of uncertain common noise.
method Proposes a robust mean-field control framework and proves existence of optimal controls.
result Existence of optimal open-loop controls linked to a lifted robust Markov decision problem.
Robust Q-learning for mean-field control under Wasserstein uncertainty
problem Mean-field control under Wasserstein uncertainty
method Quantization-and-projection scheme with Wasserstein dual reformulation
result Convergence and finite-time iteration bounds
COMRECGC finds common recourse for global counterfactual explanations in GNNs.
problem Finding common recourse for global counterfactual explanations in GNNs.
method Formalized the common recourse explanation problem and designed COMRECGC algorithm.
result COMRECGC outperforms strong baselines on four real-world graph datasets.
Tiny complexes share 3-5 triangles in common coverings.
problem Complexes sharing common coverings with finite triangles.
method Pseudo-simplicial triangulation analysis.
result Minimum triangles in common coverings are 3, 4, or 5.
In this paper, we propose a novel learning framework for the problem of domain transfer learning. We map the data of two domains to one single common space, and learn a classifier in this common space. Then we adapt the common classifier to the two domains by adding two adaptive functions to it respectively. In the com…
Bayesian optimization improves performance with common random numbers.
problem Optimizing expensive stochastic functions with common random numbers.
method Proposes a novel Gaussian process model and Knowledge Gradient for Common Random Numbers.
result Significant performance improvements with moderate computational cost.
Venn GAN models multiple distributions, discovering shared and unique aspects.
problem Modeling and understanding multiple data distributions effectively.
method A GAN design with shared and non-shared generator distributions.
result Effective modeling of various datasets (MNIST, Fashion MNIST, CIFAR-10, Omniglot, CelebA).
Minimal example found for two finite CW-complexes sharing a common covering.
problem Finding the minimum number of 2-cells in two finite CW-complexes that share a common covering.
method Constructing an almost minimal example with two 2-cells in each complex.
result Minimal example with two 2-cells in each complex.
Common positive stabilisation found for isotopic contact structures.
problem Isotopic contact structures and open book decompositions.
method Sequence of positive stabilisations and destabilisations.
result Common positive stabilisation exists for isotopic contact structures.
Learning-based BnB improves maximum common subgraph search efficiency.
problem Finding maximum common subgraphs efficiently.
method Inspired by reinforcement learning, a heuristic to reach tree leaves early.
result Significantly reduces search tree size and outperforms existing BnB algorithms.
Adversarial training improves robustness against common corruptions.
problem Improving robustness of models against common corruptions.
method Adversarial training with ℓp perturbation and learned perceptual similarity. result Our approach leads to state-of-the-art performance on common corruptions.
Recent studies have significantly improved the state-of-the-art on common-sense reasoning (CSR) benchmarks like the Winograd Schema Challenge (WSC) and SWAG. The question we ask in this paper is whether improved performance on these benchmarks represents genuine progress towards common-sense-enabled systems. We make ca…
New method improves deep CCA by modeling private components conditionally independent of common factors.
problem Discovering latent co-variation in multiview datasets with weak common factors.
method Proposes a novel formulation that models private components conditionally independent of common factors.
result Validates the approach with synthetic and real datasets, showing improved identification of common factors.
We present a new proof of Reidemeister and Singer's Theorem that any two Heegaard splittings of the same 3-manifold have a common stabilization. The proof leads to an upper bound on the minimal genus of a common stabilization in terms of the number of negative slope inflection points and type-two cusps in a Rubinstein-…
The study measures systemic risk using common and tail dependence factors.
problem Measuring systemic risk accurately during economic downturns.
method Modeling systemic risk with a common factor for market-wide shocks and a tail dependence factor for extreme events.
result Measures including a tail dependence factor offer better forecasting of financial stress than measures based solely on a common factor.
Common Representation Learning (CRL), wherein different descriptions (or views) of the data are embedded in a common subspace, is receiving a lot of attention recently. Two popular paradigms here are Canonical Correlation Analysis (CCA) based approaches and Autoencoder (AE) based approaches. CCA based approaches learn …
We show that for any two Heegaard splittings of genus p and q for the same closed 3-manifold, there is a common stabilization of genus at most 3/2 p + 2q - 1. One may compare this to recent examples of Heegaard splittings whose smallest common stabilizations have genus at least p+q or p+1/2q depending on the…
Measuring the relationship between any pair of variables is a rich and active area of research that is central to scientific practice. In contrast, characterizing the common information among any group of variables is typically a theoretical exercise with few practical methods for high-dimensional data. A promising sol…
ZSL-KG learns class representations from common sense knowledge graphs.
problem Predicting classes without labeled examples using semantic class representations.
method TrGCN, a novel transformer graph convolutional network, embeds nodes from common sense knowledge graphs in a vector space.
result ZSL-KG improves over existing methods on five out of six zero-shot benchmark datasets.
Proposes D-CDLF for multi-view data decomposition.
problem Uncorrelatedness between common and distinctive latent factors.
method Decomposes data into common, distinctive, and noise components.
result Effective uncorrelatedness between distinctive latent factors from different views.
New formula for portfolio risk management using conditional PDEs.
problem Optimal diversification and risk management of portfolios.
method Closed-form formula for conditional probability, Gaussian copulas, conditional risk-neutral PDE.
result Dynamic monitoring of portfolio volatilities and weights from PDEs.
In this paper, we address the problem of hidden common variables discovery from multimodal data sets of nonlinear high-dimensional observations. We present a metric based on local applications of canonical correlation analysis (CCA) and incorporate it in a kernel-based manifold learning technique.We show that this metr…
Optimizes portfolios using neural network approximations of asset sensitivities to common drivers.
problem Optimizing portfolios with complex asset dynamics and common drivers.
method Model asset dynamics with PDEs, approximate sensitivities with neural networks, and use hierarchical clustering on sensitivity matrix for optimization.
result Achieves over-performance in portfolio optimization across various markets and datasets.
Direct proof of implication between geometric convex hull statements.
problem Deriving one geometric convex hull statement from another.
method Direct proof of implication between statements.
result Direct derivation of one geometric convex hull statement from another.
NestedVAE isolates common factors from paired images without additional supervision.
problem Reduction of data-driven biases in machine learning models.
method Combines deep latent variable models with information bottleneck theory.
result NestedVAE significantly outperforms alternative methods in various tasks.
InGRA models for efficient Granger causality learning in multivariate time series.
problem Efficiently modeling Granger causality in large-scale multivariate time series data.
method Inductive GRanger causal modeling (InGRA) framework with prototypical Granger causal attention.
result InGRA detects common causal structures and infers Granger causal structures for new individuals.
Study optimal reinsurance and investment strategies under common shocks affecting financial and actuarial markets.
problem Maximizing expected exponential utility of terminal wealth in a company facing both ordinary and catastrophic claims.
method Modeling common shocks affecting financial and actuarial markets, using stochastic control and Hamilton-Jacobi-Bellman equations.
result Characterization of optimal reinsurance and investment strategies under common shock dependence.
A mixture of common skew-t factor analyzers model is introduced for model-based clustering of high-dimensional data. By assuming common component factor loadings, this model allows clustering to be performed in the presence of a large number of mixture components or when the number of dimensions is too large to be well…
In this paper, we consider the block-sparse signals recovery problem in the context of multiple measurement vectors (MMV) with common row sparsity patterns. We develop a new method for recovery of common row sparsity MMV signals, where a pattern-coupled hierarchical Gaussian prior model is introduced to characterize bo…
We extend a model of positive feedback and contagion in large mean-field systems, by introducing a common source of noise driven by Brownian motion. Although the driving dynamics are continuous, the positive feedback effect can lead to `blow-up' phenomena whereby solutions develop jump-discontinuities. Our main results…