In this work, we investigate the existence and effect of percolation in training deep Neural Networks (NNs) with dropout. Dropout methods are regularisation techniques for training NNs, first introduced by G. Hinton et al. (2012). These methods temporarily remove connections in the NN, randomly at each stage of trainin...
Diffusion- and flow-based generative models have recently demonstrated strong performance in protein backbone generation tasks, offering unprecedented capabilities for de novo protein design. However, despite their generation quality, these models are constrained by slow sampling, often requiring hundreds of iterative...
Liyang Xie, Haoran Zhang, Zhendong Wang et al.· 0 citations
Empirical risk minimization (ERM) is a cornerstone of modern machine learning. This paper focuses on the man-in-the-middle (MITM) attack, wherein adversaries exploit communication vulnerabilities between devices to inject malicious updates during training. To address this challenge, we propose RESIST (Resilient dEcentr...
Cheng Fang, Rishabh Dixit, Waheed U. Bajwa et al.· 0 citations
A theoretical foundation for designing group-equivariant neural networks that align the choice of symmetries with the underlying probability distributions of the data is developed and there can be performance gains when one utilises smaller permutation symmetries within the constituents.
Vishal S. Ngairangbam, M. Spannowsky· arXiv.org· 1 citation
Reach audiences
Advertise in front of researchers, engineers, and readers.
On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future...
Yaozhong Gan, Renye Yan, Zhe Wu et al.· 0 citations
We study the optimal sample complexity of tabular reinforcement learning for infinite-horizon discounted Markov decision processes. The unrestricted minimax sample complexity is known to scale as $\widetilde\Theta((1-\gamma)^{-3}\epsilon^{-2})$, where $\gamma$ denotes the discount factor and $\epsilon$ is the solution-...
Shengbo Wang, Jose Blanchet, Peter Glynn· 0 citations
We propose a data-driven approach to quantify the uncertainty of models constructed by kernel methods. Our approach minimizes the needed distributional assumptions, hence, instead of working with, for example, Gaussian processes or exponential families, it only requires knowledge about some mild regularity of the measu...
JAREX (Joint Acceptable Region EXploration), a Bayesian active-learning acquisition function for multi-objective process characterization, provides a modular framework for adaptive, data-efficient multi-objective algorithmic process characterization, supporting sample-efficient range finding in high-dimensional spaces.
In this paper, we study nonasymptotic $L^p$ error bounds for interval length and conditional coverage in split conformalized quantile regression (CQR). Our bounds rely on local regularity conditions and accuracy guarantees for the estimated quantiles. We further instantiate our bounds for quantile regression with spars...
R. Isaev, Anton Conrad, D. Belomestny et al.· 0 citations
A greedy local-search algorithm is proposed, grounded in the Fiduccia-Mattheyses bipartitioning framework, that discovers the disparity-maximising partition without any predefined group labels and is passed directly to Fair PCA, completing a detect-explain-mitigate pipeline.
Artificial representative trees with leaf-wise Mondrian conformal predictive systems provides a single, interpretable, and stable model for continuous predictions and calibrated probabilities, balancing predictive performance with reproducibility and transparency in settings where stability and interpretability are ess...
Lea L. Mairhöfer, Silke Szymczak, Björn-Hergen Laabs et al.· 0 citations
Higher bounds of adversarial robustness are proved for every concept class of $\operatorname{VC}$ of $\operatorname{VC}$ dimension $d$ in the realizable and agnostic settings and an optimal first-order refinement of the latter, together with an optimal first-order refinement of the latter.
A machine-learning approach called CheMeleon provides a practical way to develop new drugs or other molecules with much less detailed, expensive experimentation.
Is your company’s AI sovereign? A practical guide for CIOs on AI vendor lock-in, EU Data Act switching, cloud sovereignty, and testing your exit plan before you need it. The post Sovereignty Is the Option to Leave appeared first on GPT-Lab.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.