Searcharxiv⌕ Search

arXiv subjects

S. Mahmoud Taheri

Publications and source records attributed to S. Mahmoud Taheri.

2 recordsLinked to original sources

On weight and variance uncertainty in neural networks for regression tasks

We investigate the problem of weight uncertainty originally proposed by [Blundell et al. (2015). Weight uncertainty in neural networks. In International conference on machine learning, 1613-1622, PMLR.] in the context of neural networks designed for regression tasks, and we extend their framework by incorporating variance uncertainty into the model. Our analysis demonstrates that explicitly modeling uncertainty in the variance parameter can significantly enhance the predictive performance of Bayesian neural networks. By considering a full posterior distribution over the variance, the model achieves improved generalization compared to approaches that treat variance as fixed or deterministic. We evaluate the generalization capability of our proposed approach through a function approximation example and further validate it on the riboflavin genetic dataset. Our exploration encompasses both fully connected dense networks and dropout neural networks, employing Gaussian and spike-and-slab priors respectively for the network weights, providing a comprehensive assessment of how variance uncertainty affects model performance across different architectural choices.

stat.ML↗

Distributed Maximal Independent Set on Scale-Free Networks

The problem of distributed maximal independent set (MIS) is investigated on inhomogeneous random graphs with power-law weights by which the scale-free networks can be produced. Such a particular problem has been solved on graphs with $n$ vertices by state-of-the-art algorithms with the time complexity of $O(\log{n})$. We prove that for a scale-free network with power-law exponent $β> 3$, the induced subgraph is constructed by vertices with degrees larger than $\log{n}\log^{*}{n}$ is a scale-free network with $β' = 2$, almost surely (a.s.). Then, we propose a new algorithm that computes an MIS on scale-free networks with the time complexity of $O(\frac{\log{n}}{\log{\log{n}}})$ a.s., which is better than $O(\log{n})$. Furthermore, we prove that on scale-free networks with $β\geq 3$, the arboricity and degeneracy are less than $2^{log^{1/3}n}$ with high probability (w.h.p.). Finally, we prove that the time complexity of finding an MIS on scale-free networks with $β\geq 3$ is $O(log^{2/3}n)$ w.h.p.

cs.DC↗