Zobrazeno 1 - 10
of 433
pro vyhledávání: '"Hamprecht Fred A"'
We consider a Gibbs distribution over all spanning trees of an undirected, edge weighted finite graph, where, up to normalization, the probability of each tree is given by the product of its edge weights. Defining the weighted degree of a node as the
Externí odkaz:
http://arxiv.org/abs/2409.13472
Large Language Models (LLMs) have revolutionised natural language processing, exhibiting impressive human-like capabilities. In particular, LLMs are capable of "lying", knowingly outputting false statements. Hence, it is of interest and importance to
Externí odkaz:
http://arxiv.org/abs/2407.12831
In many applications of geometric deep learning, the choice of global coordinate frame is arbitrary, and predictions should be independent of the reference frame. In other words, the network should be equivariant with respect to rotations and reflect
Externí odkaz:
http://arxiv.org/abs/2405.15389
Cell tracking remains a pivotal yet challenging task in biomedical research. The full potential of deep learning for this purpose is often untapped due to the limited availability of comprehensive and varied training data sets. In this paper, we pres
Externí odkaz:
http://arxiv.org/abs/2404.16421
Spanning trees are an important primitive in many data analysis tasks, when a data set needs to be summarized in terms of its "skeleton", or when a tree-shaped graph over all observations is required for downstream processing. Popular definitions of
Externí odkaz:
http://arxiv.org/abs/2404.06447
Visualization is a crucial step in exploratory data analysis. One possible approach is to train an autoencoder with low-dimensional latent space. Large network depth and width can help unfolding the data. However, such expressive networks can achieve
Externí odkaz:
http://arxiv.org/abs/2306.17638
Publikováno v:
The Journal of Chemical Physics 159, 144113 (2023)
Orbital-free density functional theory (OF-DFT) holds the promise to compute ground state molecular properties at minimal cost. However, it has been held back by our inability to compute the kinetic energy as a functional of the electron density only
Externí odkaz:
http://arxiv.org/abs/2305.13316
Branched Optimal Transport (BOT) is a generalization of optimal transport in which transportation costs along an edge are subadditive. This subadditivity models an increase in transport efficiency when shipping mass along the same route, favoring bra
Externí odkaz:
http://arxiv.org/abs/2210.07702
Publikováno v:
ICLR 2023
Neighbor embedding methods $t$-SNE and UMAP are the de facto standard for visualizing high-dimensional datasets. Motivated from entirely different viewpoints, their loss functions appear to be unrelated. In practice, they yield strongly differing emb
Externí odkaz:
http://arxiv.org/abs/2206.01816