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.
Examines multiagent systems for complex learning tasks.
ANN clusters multi-view data by agglomerating subviews and avoiding postprocessing.
We consider grouping as a general characterization for problems such as clustering, community detection in networks, and multiple parametric model estimation. We are interested in merging solutions from different grouping algorithms, distilling all their good qualities into a consensus solution. In this paper, we propo…
A new topology improves decentralized learning efficiency and accuracy.
Purpose - This paper seeks to take a cautionary stance to the impact of the marketing mix on customer satisfaction, via a case study deriving consensus rankings for benchmarking on selected retail stores in Malaysia. Design/methodology/approach - The ELECTRE I model is used in deriving consensus rankings via multicrite…
Constructing the adjacency graph is fundamental to graph-based clustering. Graph learning in kernel space has shown impressive performance on a number of benchmark data sets. However, its performance is largely determined by the chosen kernel matrix. To address this issue, the previous multiple kernel learning algorith…
FedCBO solves clustered federated learning by optimizing groups of users without knowing their structure.
PoEL protocol aims to efficiently create and secure liquidity for blockchain networks.
WISCA generates consensus explanations from conflicting model-agnostic interpretability methods.
Bayesian consensus improves accuracy of forecasts from miscalibrated sources.
Bayesian framework for online consensus prediction from expert feedback.
In distributed machine learning, where agents collaboratively learn from diverse private data sets, there is a fundamental tension between consensus and optimality. In this paper, we build on recent algorithmic progresses in distributed deep learning to explore various consensus-optimality trade-offs over a fixed commu…
Paper analyzes convergence of decentralized algorithms with noise and bias.
CB-APM uses analyst consensus as a bottleneck to interpret stock returns.
Paper proves PI consensus algorithm converges exponentially under restricted secant inequality.
Systematizes blockchain decentralization taxonomy and metrics.
We use a cluster ensemble to determine the number of clusters, k, in a group of data. A consensus similarity matrix is formed from the ensemble using multiple algorithms and several values for k. A random walk is induced on the graph defined by the consensus matrix and the eigenvalues of the associated transition proba…
To devise efficient solutions for approximating a mean partition in consensus clustering, Dimitriadou et al. [3] presented a necessary condition of optimality for a consensus function based on least square distances. We show that their result is pivotal for deriving interesting properties of consensus clustering beyond…
A new algorithm reduces communication in decentralized optimization.
Consensus clustering fuses diverse basic partitions (i.e., clustering results obtained from conventional clustering methods) into an integrated one, which has attracted increasing attention in both academic and industrial areas due to its robust and effective performance. Tremendous research efforts have been made to t…
We present here an introduction to Brainstorming approach, that was recently proposed as a consensus meta-learning technique, and used in several practical applications in bioinformatics and chemoinformatics. The consensus learning denotes heterogeneous theoretical classification method, where one trains an ensemble of…
Adversaries can manipulate cooperative MARL networks.
A novel framework for consensus clustering is presented which has the ability to determine both the number of clusters and a final solution using multiple algorithms. A consensus similarity matrix is formed from an ensemble using multiple algorithms and several values for k. A variety of dimension reduction techniques …
Determinantal consensus clustering improves clustering robustness.
CoHiRF extends clustering methods to handle high-dimensional data efficiently.
IMPACC improves consensus clustering for bioinformatics data.
The distribution of price returns for a class of uncorrelated diffusive dynamics is considered. The basic assumptions are (1) that there is a "consensus" value associated with a stock, and (2) that the rate of diffusion depends on the deviation of the stock price from the consensus value. We find an analytical expressi…
Consensus dimension reduction combines multiple visualizations to identify shared patterns.
SBO uses dual voting to build consensus in noisy feedback settings.
The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost f…
Study on consensus formation in manifolds with curvature constraints.
New Ising models improve consensus clustering on specialized hardware.
Deep learning has demonstrated abilities to learn complex structures, but they can be restricted by available data. Recently, Consensus Networks (CNs) were proposed to alleviate data sparsity by utilizing features from multiple modalities, but they too have been limited by the size of labeled data. In this paper, we ex…
Network embedding leverages the node proximity manifested to learn a low-dimensional node vector representation for each node in the network. The learned embeddings could advance various learning tasks such as node classification, network clustering, and link prediction. Most, if not all, of the existing works, are ove…
Suppose that multiple experts (or learning algorithms) provide us with alternative Bayesian network (BN) structures over a domain, and that we are interested in combining them into a single consensus BN structure. Specifically, we are interested in that the consensus BN structure only represents independences all the g…
Crowdlab uses classifiers to estimate consensus labels and annotator quality.
A new framework for clustering high-dimensional data using vertical shards.
This paper considers the problem of detection in distributed networks in the presence of data falsification (Byzantine) attacks. Detection approaches considered in the paper are based on fully distributed consensus algorithms, where all of the nodes exchange information only with their neighbors in the absence of a fus…
New voting strategies show committee-based consensus can scale efficiently.
Paper defines a new pseudometric for measuring consensus among subsets of relations.
Unified view connects CoCoA and ADMM for distributed ERM.
Paper introduces robust methods for consensus ranking in AI systems.
This work presents a two-stage neural architecture for learning and refining structural correspondences between graphs. First, we use localized node embeddings computed by a graph neural network to obtain an initial ranking of soft correspondences between nodes. Secondly, we employ synchronous message passing networks …
New methods reveal consensus and dissensus in network partitions.
Decentralized ranking consensus via gossip for robust and scalable systems.
Preventing early progression of epilepsy and so the severity of seizures requires an effective diagnosis. Epileptic transients indicate the ability to develop seizures but humans overlook such brief events in an electroencephalogram (EEG) what compromises patient treatment. Traditionally, training of the EEG event dete…
Since deep neural networks are over-parameterized, they can memorize noisy examples. We address such a memorization issue in the presence of label noise. From the fact that deep neural networks cannot generalize to neighborhoods of memorized features, we hypothesize that noisy examples do not consistently incur small l…
New method for summarizing ranking distributions using consensus ranking distributions.