Proposes a method to learn rankings from multiple sources.
problem Learning to rank from multiple information sources.
method Generic framework for multi-view subspace learning to rank (MvSL2R) with autoencoder-like networks and end-to-end solutions.
result Enhances joint ranking with minimum view-specific ranking loss, achieving maximum global view agreements.
In many machine learning problems, labeled training data is limited but unlabeled data is ample. Some of these problems have instances that can be factored into multiple views, each of which is nearly sufficent in determining the correct labels. In this paper we present a new algorithm for probabilistic multi-view lear…
A new method for combining multiple data views in supervised learning.
problem Combining multiple data views in supervised learning, especially in biology and medicine.
method Cooperative learning combines squared error loss with an agreement penalty to encourage predictions from different data views to agree.
result Cooperative learning achieves higher predictive accuracy on simulated and real multiomics data.
This paper presents eight PAC-Bayes bounds to analyze the generalization performance of multi-view classifiers. These bounds adopt data dependent Gaussian priors which emphasize classifiers with high view agreements. The center of the prior for the first two bounds is the origin, while the center of the prior for the t…
Study proves existence of global solutions for Standard Model on expanding spacetimes.
problem Existence of global solutions for the Standard Model on expanding spacetimes.
method Gauge-invariant energy estimate for the Euler-Lagrange equations.
result Existence of global solutions for the Standard Model under specific conditions.
Multi-view spectral clustering, which aims at yielding an agreement or consensus data objects grouping across multi-views with their graph laplacian matrices, is a fundamental clustering problem. Among the existing methods, Low-Rank Representation (LRR) based method is quite superior in terms of its effectiveness, intu…
Proposes a method for two-sided clustering of co-occurrence data.
problem Efficient clustering of co-occurrence data in multi-view settings.
method Information-theoretic multi-view co-clustering (MV-ITCC).
result Demonstrates superior performance on text and image datasets.
This paper examines how regional trade agreements affect global trade relationships.
problem The relationship between regional trade agreements and global trade purity.
method Defined and decomposed synthesized trade resistance, separated natural and artificial factors, used expectation maximization algorithm to optimize parameters, and quantified trade purity indicator.
result Regional trade agreements contribute to the relative prosperity of EU and NAFTA countries, but weaken the role of trade unions and accelerate multilateral trade liberalization.
Co-learning BO improves global optimization with limited samples.
problem Suboptimal solutions in Bayesian optimization due to poor surrogate accuracy.
method Build multiple Gaussian process models to complement each other and reduce prediction errors.
result CLBO achieves more efficient global optimization with fewer samples.
New approach combines multi-view learning for improved convergence in knowledge transfer.
problem Improving convergence in knowledge transfer settings like learning with privileged information and distillation.
method Adopting a multi-view approach under reasonable assumptions about hypothesis spaces, encouraging agreement between teacher and student.
result Improved convergence rate achieved with regularized empirical risk minimization.
Unified multi-view sentence representation improves downstream tasks.
problem Improving sentence representation learning from diverse views.
method Unified multi-view sentence representation learning framework using RNN and linear model, maximizing agreement with adjacent context.
result Improved representations and transferability on downstream tasks.
The study quantifies how many objects can be linearly classified under all views.
problem Understanding the expressivity of group-equivariant representations.
method Generalization of Cover's Function Counting Theorem to quantify separable dichotomies.
result The fraction of separable dichotomies is determined by the fixed space dimension of the group action.
Paper proposes a new approach for multi-view subspace clustering.
problem Multi-view subspace clustering problem.
method Shared affinity matrix with low-rank and sparsity constraints, solved using ADMM.
result Outperforms state-of-the-art algorithms on synthetic and real-world datasets.
The input data features set for many data driven tasks is high-dimensional while the intrinsic dimension of the data is low. Data analysis methods aim to uncover the underlying low dimensional structure imposed by the low dimensional hidden parameters by utilizing distance metrics that consider the set of attributes as…
Study compares and contrasts various ML explanation methods, highlighting their disagreements and similarities.
problem Understanding and quantifying the differences between various machine learning explanation methods.
method Synthesized and visualized various explanation methods for global and local aspects of ML models.
result There is substantial agreement on the top features but less on specific rankings, and tree interpreter is comparable to SHAP for feature effects.
The paper uses Black-Scholes model to analyze political support and coalition agreements.
problem Determining the minimum support level for a minor party in a pre-electoral coalition.
method Modeling political support as a stochastic process with a deterministic growth rate and applying Black-Scholes option pricing theory.
result The minimum support level for a minor party to gain a representative in a pre-electoral coalition.
AVRA automatically rates brain atrophy from MRI images, achieving high agreement with human radiologists.
problem Manual visual rating of brain atrophy by radiologists is time-consuming and inconsistent.
method AVRA uses machine learning, trained on 2350 ratings, to automatically rate various atrophy scales.
result AVRA achieves substantial agreement with human radiologists, with Cohen's weighted kappa values of 0.74-0.74.
Our work sheds new light on the role of oil prices in shaping the world economy by investigating flows of goods and services through global value chains between 1960 and 2011, by means of Markov Chain and network analysis. We show that over that time period the international division of labor and trade patterns are tig…
SinSim improves self-supervised learning by integrating optimal transport into contrastive learning.
problem Lack of explicit regularization in contrastive learning methods leads to suboptimal generalization.
method Integrates Sinkhorn regularization from optimal transport theory into SimCLR.
result SinSim outperforms SimCLR and other self-supervised methods on various datasets.
Solves a 60-year-old question on agreement measures in statistics.
problem The challenge of measuring agreement between two raters or measures.
method Developed a new algorithm to minimize diagonals in contingency tables, formulated the minimum feasible agreement, and studied the lower limit of maximum feasible agreement.
result Formulated the lower limit of Cohen's kappa and two statistics for agreement analysis.
We investigated the critical dynamics on the daily Taiwan stock exchange index (TSE) from 1971 to 2005, and the 5-min intraday data from 1996 to 2005. A global persistence exponent θp was defined for non-equilibrium critical phenomena \cite{Janssen,Majumdar}, and describing dynamic behavior in an economic index \c…
The paper explores global index formulas for one-dimensional holomorphic foliations.
problem Global index formulas for one-dimensional holomorphic foliations.
method Microlocal point of view and short proofs for existing index formulas.
result Generalizations of existing index formulas.
Unified framework for comparing clusterings from information-theoretic and pair-counting perspectives.
problem Divergent evaluations of unsupervised models due to different clustering similarity measures.
method Developed an analytical framework that unifies pair-counting and information-theoretic clustering similarity measures.
result Unified framework clarifies when and why the two regimes diverge and provides a principled basis for selecting and interpreting clustering similarity measures.
Proposes a novel model for healthcare and SME credit risk prediction.
problem Lack of guidance from global view in sequence representation learning for time series modeling.
method Hierarchical Global View-guided (HGV) sequence representation learning framework with GGE and β-Attn modules. result Competitive prediction performance compared with other known baselines.
Paper proposes a new method for joint feature selection and graph learning.
problem Previous methods suffer from neglecting joint formulation and lack of graph learning.
method Formulates multi-view feature selection with orthogonal decomposition, incorporates cross-space locality preservation, and uses a unified objective function for simultaneous learning.
result Demonstrates superior performance in multi-view feature selection and graph learning tasks.
Develops a graph-based convolutional network for multi-view networks to improve poverty research.
problem Binary treatment of social network relations in graph learning models.
method Multi-GCN: Graph Convolutional Networks for Multi-View Networks.
result Multi-GCN outperforms state-of-the-art algorithms on poverty prediction tasks and broader multi-view network tasks.
This paper provides intuition on the relationship of accrual and mark-to-market valuation for cash and forward interest rate trades. Discounted cashflow valuation is compared to spread-based valuation for forward trades, which explains the trader's view on valuation. This is followed by Taylor series approximation for …
Signatures of universality are detected by comparing individual eigenvalue distributions and level spacings from financial covariance matrices to random matrix predictions. A chopping procedure is devised in order to produce a statistical ensemble of asset-price covariances from a single instance of financial data sets…
Paper predicts international trade flows using machine learning and factorization models.
problem Predicting international bilateral trade flows with PTAs.
method Two-stage approach combining SHAP Explainer and Factorization Machine models.
result Enhanced predictive accuracy and deeper insights into trade dynamics.
Distributed learning method for multi-agent reinforcement learning with policy coordination.
problem Solving multi-agent reinforcement learning problems with coordination.
method Distributed off-policy actor critic with policy consensus.
result The proposed algorithm achieves asymptotic agreement on the global optimal policy function.
A global agreement on how to reduce and cap human footprint, especially their GHG emissions, is very unlikely in near future. At the same time, bilateral agreements would be inefficient because of their neural and balanced nature. Therefore, unilateral actions would have attracted attention as a practical option. Howev…
An explicit solution found for maximizing/minimizing agreement in a 2x2 table.
problem Maximizing or minimizing agreement between clusterings with given marginals.
method Formal framework for several agreement measures, explicit solution for 2x2 table.
result An explicit solution for the 2x2 case.
Proposes a novel graph representation learning framework using contrastive methods.
problem Graph representation learning for graph-structured data.
method Leverages a contrastive objective at the node level, generating two graph views by corruption and learning node representations by maximizing agreement.
result Consistently outperforms existing state-of-the-art methods on transductive and inductive learning tasks.
Global catastrophe risk pools increase financial resilience by diversifying risk and including more countries.
problem Low- to middle-income countries rely heavily on foreign aid for recovery from extreme weather events, which is slow and uncertain.
method Developed a method to form global catastrophe risk pools that maximize risk diversification and select countries with low bilateral correlations or low shares in the pool risk.
result Global pooling increases risk diversification, lowers countries' shares in the pool risk, and increases the number of countries benefiting from risk pooling.
Study compares CDS databases and finds discrepancies due to various factors.
problem Comparing discrepancies among CDS databases.
method Comparing five major sources of corporate CDS prices over 2004-2010.
result CMA quotes lead price discovery and databases disagree on stock-CDS return analysis.
Optimal transport and neural networks improve trade modeling accuracy.
problem Capturing subtler drivers of trade beyond supply and demand.
method Employing optimal transport and deep neural networks to learn a time-dependent cost function from data.
result Consistently outperforms traditional gravity models in accuracy.
The study proves uniqueness of certain types of solitons.
problem Proving uniqueness of asymptotically cylindrical shrinking Ricci solitons.
method Analyzing the behavior of solitons at spatial infinity and using order agreement conditions.
result Proven that such solitons are either isometric to the cylinder or its quotient.
The paper develops a new algorithm for RBMs using dynamical mean-field theory.
problem Learning in Restricted Boltzmann Machines (RBMs) with complex dependencies.
method Dynamical mean-field theory applied to RBMs with rectangular coupling matrices drawn from a bi-rotation invariant ensemble.
result The algorithm converges globally under a stability criterion, with rates matching numerical simulations.
This work introduces significativity indices for agreement values between classifiers.
problem Evaluating the quality of agreement measures between classifiers.
method Proposes general approach and two specific indices for evaluation.
result Introduces two new significativity indices for evaluating agreement values.
Bayesian Optimization (BO) has become a core method for solving expensive black-box optimization problems. While much research focussed on the choice of the acquisition function, we focus on online length-scale adaption and the choice of kernel function. Instead of choosing hyperparameters in view of maximum likelihood…
In this paper we provide a \emph{global} investigation of the geometry of parallelizable manifolds (or absolute parallelism geometry) frequently used for application. We discuss the different linear connections and curvature tensors from a global point of view. We give an existence and uniqueness theorem for a remarkab…
SNAP improves robust computation by emphasizing trustworthy items and downweighting outliers.
problem Improving robustness in computation, especially in high-dimensional settings.
method SNAP assigns weights based on mutual agreement, suppressing outlier contributions.
result SNAP ensures outliers contribute negligibly to computations, even in high-dimensional settings.
We present Manifold Alignment Determination (MAD), an algorithm for learning alignments between data points from multiple views or modalities. The approach is capable of learning correspondences between views as well as correspondences between individual data-points. The proposed method requires only a few aligned exam…
The problem of estimation error of Expected Shortfall is analyzed, with a view of its introduction as a global regulatory risk measure.
A neural network combines multi-view mammography data for breast cancer classification.
problem Classifying breast microcalcifications as benign or malignant using multiple imaging views.
method Mixture of Views network architecture for multi-view data fusion.
result The method outperforms existing fusion methods in classifying breast microcalcifications.
Derives energy-momentum tensor from Standard Model, examines energy conditions.
problem Validating energy conditions in the context of the Standard Model.
method Geometric variational problem on globally hyperbolic manifold, deriving energy-momentum tensor.
result Validates various energy conditions in general relativity.
New framework assesses neural sensitivity to small perturbations.
problem Comparing neural representations' sensitivity to small changes.
method Local decodable information, Fisher information, and projected pullback/Fisher metric.
result Reveals differences in neural sensitivity not captured by activation alignment.
Proposes a new method for joint sample and feature selection in multi-view data.
problem Cannot detect latent subsets of samples and remove outliers.
method Weighted Sparse Partial Least Squares (ℓ∞/ℓ0-wsPLS) method for joint sample and feature selection. result Developed globally convergent algorithm and iterative algorithms for multi-view data fusion.