Algorithm for agents to agree on a single objective in multi-task networks.
problem Decentralized decision-making in multi-task networks with multiple objectives.
method Distributed decision-making algorithm for agents observing different models.
result Agents reach agreement on which model to track for network performance enhancement.
The paper analyzes indices based on counting object pairs for assessing partition agreement in unsupervised learning.
problem The difficulty in interpreting overall indices like Rand and adjusted Rand indices.
method Analysis of three families of indices based on counting object pairs, decomposing overall indices into cluster-level indices.
result Overall indices based on pair-counting approach are sensitive to cluster size imbalance and provide limited information on smaller clusters.
A new capsule routing algorithm derived from Variational Bayes improves performance in neural networks.
problem Improving performance of capsule networks in recognizing objects and their parts.
method Proposed a new capsule routing algorithm derived from Variational Bayes to fit a mixture of transforming gaussians.
result Significant improvement in MNIST to affNIST generalization over previous works.
Discriminatory trade liberalization policies are becoming more popular among world economies. Countries are motivated to enter for regional trade agreements to capture faster economic growth for alleviating poverty. In developing economies like most of the member countries of the Association of South East Asian Nations…
In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph G with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-' edges cut across clusters. BCC is known to be NP-hard. We present a novel approx…
Researchers develop multi-agent systems for quadcopters to collaborate in missions.
problem Enable multiple quadcopters to work together in remote sensing tasks.
method Agent dynamics, network topologies, collective behaviors, agreement protocol, equations of motion for quadcopters.
result Multi-agent systems can successfully collaborate in remote sensing missions.
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.
MAS scores cluster size consistency from points, robust to label changes.
problem Desired uniformity in cluster sizes, stability under label perturbations.
method Mass Agreement Score (MAS) measures point-centric cluster size consistency, robust to label changes.
result MAS yields similar scores for partitions with similar bulk structure, sensitive to genuine redistribution of cluster mass.
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.
Fuses ITRs for primary and secondary outcomes to minimize harm.
problem Learn an ITR maximizing primary outcome while minimizing harm to secondary outcomes.
method Introduces fusion penalty to encourage similar recommendations for different outcomes. Two algorithms estimate the ITR using surrogate loss functions.
result Agreement rate between primary and secondary optimal ITRs converges faster than ignoring secondary outcomes.
Local surrogate explainers vary in objectives, leading to incomparable explanations.
problem Variability in objectives among local surrogate explainers.
method Review of multiple local surrogate explainers, focusing on extracted information.
result Diverse explanations from similar methods due to differing objectives.
ValueBlindBench tests LLM-generated investment rationales for validity before returns are known.
problem Delayed-ground-truth evaluation of LLM-generated investment rationales.
method Agreement-gated stress testing protocol to validate LLM-judged rationales.
result ValueBlindBench prevents overclaims and identifies flawed financial constructs.
Geometric Capsule Autoencoders group 3D points into parts and objects.
problem Learning object representations from 3D point clouds.
method Geometric capsules with pose and feature components, Multi-View Agreement voting mechanism.
result Learned representations enable object identification and canonical pose recovery.
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.
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.
Paper tackles zero-shot translation by encouraging consistent agreement in models.
problem Challenges of generalizing multilingual translation without parallel data.
method Reformulated as probabilistic inference, introduced consistent agreement-based training.
result Agreement-based learning improves zero-shot translation by 2-3 BLEU points.
This paper proposes a new method to improve meta-learning models.
problem Improving generalization in meta-learning models.
method Gradient agreement optimization to control task weights in loss function.
result Meta-learning models with better generalization achieved.
LFD method improves text classification by making features clearer and less label-leaking.
problem Creating interpretable text representations that are both predictive and understandable.
method LFD method: proposes lexical and semantic features from contrastive text pairs, screens candidates using κ, and selects features by residual gain. result LFD features achieve higher human-human and human-LLM agreement than baseline concepts and are less label-leaking.
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.
Formula found for minimum ARI between clusterings of fixed sizes.
problem Understanding the lowest possible agreement between clusterings.
method Explicit formula derivation for minimum ARI.
result A specific pair of clusterings achieving the minimum ARI is provided.
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…
Enhances financial data signal-to-noise ratio using auto-encoders and mutual regularization.
problem Improving signal-to-noise ratio in financial data.
method Combining target and context variables, using auto-encoders with mutual regularization to learn common ground.
result Discover new regularities in financial time-series data.
Improves deep learning models by blending gradients from training loss and auxiliary objective.
problem Minimizing a single training loss while encouraging desirable model properties.
method Solves a bilevel optimization problem by combining training loss gradients and orthogonal projections of auxiliary gradients.
result Bloop method leads to better performance than other gradient surgery methods without EMA.
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…
Capsule networks can only represent symmetric functions due to routing limitations.
problem Capsule networks' expressivity is limited to symmetric functions.
method Proved and empirically demonstrated that EM-routing and routing-by-agreement prevent capsule networks from distinguishing inputs and their negative counterpart.
result Capsule networks are not universal approximators due to the limitation of expressivity.
Concept modulation models unify identifiability and extrapolation in conditional latent variable models.
problem Reliable generalization in conditional latent variable models
method Concept modulation models (CMMs) with structure AoΛoCoX result Lifts identifiability to conditional settings and controls extrapolation through attribute potentials.
Model selection is a problem that has occupied machine learning researchers for a long time. Recently, its importance has become evident through applications in deep learning. We propose an agreement-based learning framework that prevents many of the pitfalls associated with model selection. It relies on coupling the t…
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.
Develops neural network framework for risk-reward optimization problems.
problem Multi-period risk-reward optimization with constrained policies.
method Neural network framework with two coupled feedforward networks, parametrizing two-step policies.
result Empirical optimum converges to true optimal value as network capacity and training size increase.
A new clustering framework optimizes customer search data for personalized travel recommendations.
problem Personalized travel recommendations based on customer search data.
method Multi-objective optimization-based clustering ensemble framework.
result Optimizes diversity in clustering ensemble search space and automatically determines the number of clusters.
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.
Computable contracts simplify financial transactions and reduce legal costs.
problem Difficulty in querying, executing, and analyzing text-based financial contracts.
method Develop a Contract Definition Language and illustrate use cases.
result Substantial improvements in customer experience and cost reduction.
We apply an asymmetric version of Kirman's herding model to volatile financial markets. In the relation between returns and agent concentration we use the square root law proposed by Zhang. This can be derived by extending the idea of a critical mean field theory suggested by Plerou et al. We show that this model is eq…
Study finds simple model-agreement scores perform well in various error estimation scenarios.
problem Evaluating model performance on unseen distributions using disparate scoring functions.
method Rigorously studied popular scoring functions (confidence, local manifold smoothness, model agreement) independently of mechanism choice.
result Simple model-agreement scores outperform confidence- and smoothness-based scores in realistic settings with compromised training data.
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.
In order to adapt to the liberalization of the financial sphere started in the Eighties, marked in particular by the end of the framing of credit, the disappearance of the various forms of protection of the State whose profited the banks, and the privatization of the near total of the establishments in Europe, the bank…
Ensemble learning is a powerful approach to construct a strong learner from multiple base learners. The most popular way to aggregate an ensemble of classifiers is majority voting, which assigns a sample to the class that most base classifiers vote for. However, improved performance can be obtained by assigning weights…
Study shows more data improves model explanations, aiding reliable knowledge extraction.
problem Challenges in deriving reliable knowledge from machine learning models due to the Rashōmon effect.
method Examined the influence of sample size on explanations from models in a Rashōmon set using SHAP.
result Explanations from <128 samples are highly variable, but agreement improves with more data.
There is considerable debate whether the domestic political institutions (specifically, the country s level of democracy) of the host developing country toward foreign investors are effective in establishing the credibility of commitments are still underway, researchers have also analyzed the effect of international in…
Unified framework for policy learning using weak supervision.
problem High-quality supervision is often infeasible or expensive in practice.
method Treat weak supervision as imperfect peer information and evaluate policies based on correlated agreement.
result Substantial performance improvements, especially in complex or noisy environments.
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.
Model explains money creation under regulatory constraints.
problem Understanding money creation dynamics under regulatory pressures.
method Agent-based model of secured interbank network.
result Excess liquidity and repurchase agreements emerge due to regulatory constraints.
New index improves anomaly detection in correlated time series data.
problem Challenges in evaluating cluster quality for anomaly detection.
method Introduced Synchronized Anomaly Agreement Index (SAAI) to assess cluster quality.
result Maximizing SAAI improves anomaly detection accuracy by 0.23 compared to SSC and by 0.32 compared to X-Means.
X-Caps improves medical diagnosis explainability by encoding visual attributes in capsules.
problem Uninterpretable predictions from deep neural networks in healthcare.
method Teaches a novel multi-task capsule network to encode high-level visual attributes and malignancy scores.
result X-Caps outperforms state-of-the-art deep dense 3D CNNs in capturing visually interpretable attributes and malignancy prediction.
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.
We consider the problem of decentralized consensus optimization, where the sum of n smooth and strongly convex functions are minimized over n distributed agents that form a connected network. In particular, we consider the case that the communicated local decision variables among nodes are quantized in order to all…
Thousands of first-millennium BCE ivory carvings have been excavated from Neo-Assyrian sites in Mesopotamia (primarily Nimrud, Khorsabad, and Arslan Tash) hundreds of miles from their Levantine production contexts. At present, their specific manufacture dates and workshop localities are unknown. Relying on subjective, …
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.