Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Error bounds on the SCISSORS approximation method.

ABSTRACT: The SCISSORS method for approximating chemical similarities has shown excellent empirical performance on a number of real-world chemical data sets but lacks theoretically proven bounds on its worst-case error performance. This paper first proves reductions showing SCISSORS to be equivalent to two previous kernel methods: kernel principal components analysis and the rank-k Nystro?m approximation of a Gram matrix. These reductions allow the use of generalization bounds on these techniques to show that the expected error in SCISSORS approximations of molecular similarity kernels is bounded in expected pairwise inner product error, in matrix 2-norm and Frobenius norm for full kernel matrix approximations and in root-mean-square deviation for approximated matrices. Finally, we show that the actual performance of SCISSORS is significantly better than these worst-case bounds, indicating that chemical space is well-structured for chemical sampling algorithms.

SUBMITTER: Haque IS

PROVIDER: S-EPMC3183166 | biostudies-literature | 2011 Sep

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Error bounds on the SCISSORS approximation method.

Haque Imran S IS Pande Vijay S VS

Journal of chemical information and modeling 20110908 9

The SCISSORS method for approximating chemical similarities has shown excellent empirical performance on a number of real-world chemical data sets but lacks theoretically proven bounds on its worst-case error performance. This paper first proves reductions showing SCISSORS to be equivalent to two previous kernel methods: kernel principal components analysis and the rank-k Nyström approximation of a Gram matrix. These reductions allow the use of generalization bounds on these techniques to show t ...[more]

PMID: 21851122

Similar Datasets

Error Bounds for Dynamical Spectral Estimation.

Project description:Dynamical spectral estimation is a well-established numerical approach for estimating eigenvalues and eigenfunctions of the Markov transition operator from trajectory data. Although the approach has been widely applied in biomolecular simulations, its error properties remain poorly understood. Here we analyze the error of a dynamical spectral estimation method called "the variational approach to conformational dynamics" (VAC). We bound the approximation error and estimation error for VAC estimates. Our analysis establishes VAC's convergence properties and suggests new strategies for tuning VAC to improve accuracy.

| S-EPMC8336423 | biostudies-literature

Learning with Known Operators reduces Maximum Training Error Bounds.

Project description:We describe an approach for incorporating prior knowledge into machine learning algorithms. We aim at applications in physics and signal processing in which we know that certain operations must be embedded into the algorithm. Any operation that allows computation of a gradient or sub-gradient towards its inputs is suited for our framework. We derive a maximal error bound for deep nets that demonstrates that inclusion of prior knowledge results in its reduction. Furthermore, we also show experimentally that known operators reduce the number of free parameters. We apply this approach to various tasks ranging from CT image reconstruction over vessel segmentation to the derivation of previously unknown imaging algorithms. As such the concept is widely applicable for many researchers in physics, imaging, and signal processing. We assume that our analysis will support further investigation of known operators in other fields of physics, imaging, and signal processing.

| S-EPMC6690833 | biostudies-literature

Logical error rate in the Pauli twirling approximation.

Project description:The performance of error correction protocols are necessary for understanding the operation of potential quantum computers, but this requires physical error models that can be simulated efficiently with classical computers. The Gottesmann-Knill theorem guarantees a class of such error models. Of these, one of the simplest is the Pauli twirling approximation (PTA), which is obtained by twirling an arbitrary completely positive error channel over the Pauli basis, resulting in a Pauli channel. In this work, we test the PTA's accuracy at predicting the logical error rate by simulating the 5-qubit code using a 9-qubit circuit with realistic decoherence and unitary gate errors. We find evidence for good agreement with exact simulation, with the PTA overestimating the logical error rate by a factor of 2 to 3. Our results suggest that the PTA is a reliable predictor of the logical error rate, at least for low-distance codes.

| S-EPMC4588586 | biostudies-other

SET: a pupil detection method using sinusoidal approximation.

Project description:Mobile eye-tracking in external environments remains challenging, despite recent advances in eye-tracking software and hardware engineering. Many current methods fail to deal with the vast range of outdoor lighting conditions and the speed at which these can change. This confines experiments to artificial environments where conditions must be tightly controlled. Additionally, the emergence of low-cost eye tracking devices calls for the development of analysis tools that enable non-technical researchers to process the output of their images. We have developed a fast and accurate method (known as "SET") that is suitable even for natural environments with uncontrolled, dynamic and even extreme lighting conditions. We compared the performance of SET with that of two open-source alternatives by processing two collections of eye images: images of natural outdoor scenes with extreme lighting variations ("Natural"); and images of less challenging indoor scenes ("CASIA-Iris-Thousand"). We show that SET excelled in outdoor conditions and was faster, without significant loss of accuracy, indoors. SET offers a low cost eye-tracking solution, delivering high performance even in challenging outdoor environments. It is offered through an open-source MATLAB toolkit as well as a dynamic-link library ("DLL"), which can be imported into many programming languages including C# and Visual Basic in Windows OS (www.eyegoeyetracker.co.uk).

| S-EPMC4391030 | biostudies-literature

Stochastic Learning for Sparse Discrete Markov Random Fields with Controlled Gradient Approximation Error.

Project description:We study the L 1-regularized maximum likelihood estimator/estimation (MLE) problemfor discrete Markov random fields (MRFs), where efficient and scalable learning requires both sparse regularization and approximate inference. To address these challenges, we consider a stochastic learning framework called stochastic proximal gradient (SPG; Honorio 2012a, Atchade etal. 2014, Miasojedow and Rejchel 2016). SPG is an inexact proximal gradient algorithm [Schmidt et al., 2011], whose inexactness stems from the stochastic oracle (Gibbs sampling) for gradient approximation - exact gradient evaluation is infeasible in general due to the NP-hard inference problem for discrete MRFs [Koller and Friedman, 2009]. Theoretically, we provide novel verifiable bounds to inspect and control the quality of gradient approximation. Empirically, we propose the tighten asymptotically (TAY) learning strategy based on the verifiable bounds to boost the performance of SPG.

| S-EPMC6292514 | biostudies-literature

Approximation of bias and mean-squared error in two-sample Mendelian randomization analyses.

Project description:Mendelian randomization (MR) is a type of instrumental variable (IV) analysis that uses genetic variants as IVs for a risk factor to study its causal effect on an outcome. Extensive investigations on the performance of IV analysis procedures, such as the one based on the two-stage least squares (2SLS) procedure, have been conducted under the one-sample scenario, where measures on IVs, the risk factor, and the outcome are assumed to be available for each study participant. Recent MR analysis usually is performed with data from two independent or partially overlapping genetic association studies (two-sample setting), with one providing information on the association between the IVs and the outcome, and the other on the association between the IVs and the risk factor. We investigate the performance of 2SLS in the two-sample-based MR when the IVs are weakly associated with the risk factor. We derive closed form formulas for the bias and mean squared error of the 2SLS estimate and verify them with numeric simulations under realistic circumstances. Using these analytic formulas, we can study the pros and cons of conducting MR analysis under one-sample and two-sample settings and assess the impact of having overlapping samples. We also propose and validate a bias-corrected estimator for the causal effect.

| S-EPMC7182476 | biostudies-literature

Addressing the System-Size Dependence of the Local Approximation Error in Coupled-Cluster Calculations.

Project description:Over the last two decades, the local approximation has been successfully used to extend the range of applicability of the "gold standard" singles and doubles coupled-cluster method with perturbative triples CCSD(T) to systems with hundreds of atoms. The local approximation error grows in absolute value with the increasing system size, i.e., by increasing the number of electron pairs in the system. In this study, we demonstrate that the recently introduced two-point extrapolation scheme for approaching the complete pair natural orbital (PNOs) space limit in domain-based pair natural orbital CCSD(T) calculations drastically reduces the dependence of the error on the system size, thus opening up unprecedented opportunities for the calculation of benchmark quality relative energies for large systems.

| S-EPMC8607505 | biostudies-literature

SCISSORS: practical considerations.

Project description:Molecular similarity has been effectively applied to many problems in cheminformatics and computational drug discovery, but modern methods can be prohibitively expensive for large-scale applications. The SCISSORS method rapidly approximates measures of pairwise molecular similarity such as ROCS and LINGO Tanimotos, acting as a filter to quickly reduce the size of a problem. We report an in-depth analysis of SCISSORS performance, including a mapping of the SCISSORS error distribution, benchmarking, and investigation of several algorithmic modifications. We show that SCISSORS can accurately predict multiconformer similarity and suggest a method for estimating optimal SCISSORS parameters in a data set-specific manner. These results are a useful resource for researchers seeking to incorporate SCISSORS into molecular similarity applications.

| S-EPMC4207653 | biostudies-literature

A fast and robust iterative genome-editing method based on a Rock-Paper-Scissors strategy.

Project description:The production of optimized strains of a specific phenotype requires the construction and testing of a large number of genome modifications and combinations thereof. Most bacterial iterative genome-editing methods include essential steps to eliminate selection markers, or to cure plasmids. Additionally, the presence of escapers leads to time-consuming separate single clone picking and subsequent cultivation steps. Herein, we report a genome-editing method based on a Rock-Paper-Scissors (RPS) strategy. Each of three constructed sgRNA plasmids can cure, or be cured by, the other two plasmids in the system; plasmids from a previous round of editing can be cured while the current round of editing takes place. Due to the enhanced curing efficiency and embedded double check mechanism, separate steps for plasmid curing or confirmation are not necessary, and only two times of cultivation are needed per genome-editing round. This method was successfully demonstrated in Escherichia coli and Klebsiella pneumoniae with both gene deletions and replacements. To the best of our knowledge, this is the fastest and most robust iterative genome-editing method, with the least times of cultivation decreasing the possibilities of spontaneous genome mutations.

| S-EPMC7826264 | biostudies-literature

Simulation extrapolation method for measurement error: A review.

Project description:Measurement error is pervasive in statistics due to the non-availability of authentic data. The reasons for measurement error mainly relate to cost, convenience, and human error. Measurement error can result in non-negligible bias due to attenuated estimates, reduced power of statistical tests, and lower coverage probabilities of the coefficient estimators in a regression model. Several methods have been proposed to correct for measurement error, all of which can be grouped into two broad categories based on the underlying model-functional and structural. Functional models provide flexibility and robustness to estimators by placing minimal or no assumptions on the distribution of the mismeasured covariate or by treating them as a fixed entity, as opposed to a structural model which treats the underlying mismeasured covariates as random with a specified structure. The simulation extrapolation method is one method that is used for the partial correction of measurement error in both structural and functional models. Reviews of measurement error correction techniques are available in the literature. However, none of the previously conducted reviews has exclusively focused on simulation extrapolation and its application in continuous measurement error models, despite its widespread use and ease of application. We attempt to close this gap in the literature by highlighting its development over the past two and a half decades.

| S-EPMC10062410 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data