default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOliver J. Sutton
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Ivan Yu. Tyukin
, Tatiana Tyukina, Daniël P. van Helden, Zedong Zheng, Evgeny M. Mirkes, Oliver J. Sutton, Qinghua Zhou, Alexander N. Gorban, Penelope M. Allison:
Coping with AI errors with provable guarantees. Inf. Sci. 678: 120856 (2024)- [j5]Paul Houston, Matthew E. Hubbard, Thomas J. Radley, Oliver J. Sutton, Richard S. J. Widdowson:
Efficient High-Order Space-Angle-Energy Polytopic Discontinuous Galerkin Finite Element Methods for Linear Boltzmann Transport. J. Sci. Comput. 100(2): 52 (2024) - [j4]Oliver J. Sutton, Qinghua Zhou, Ivan Yu. Tyukin, Alexander N. Gorban, Alexander Bastounis, Desmond J. Higham:
How adversarial attacks can disrupt seemingly stable accurate classifiers. Neural Networks 180: 106711 (2024) - [c6]Ivan Yu. Tyukin, Tatiana Tyukina, Daniel van Helden, Zedong Zheng, Evgeny M. Mirkes, Oliver J. Sutton, Qinghua Zhou, Alexander N. Gorban, Penelope M. Allison:
Weakly Supervised Learners for Correction of AI Errors with Provable Performance Guarantees. IJCNN 2024: 1-8 - [c5]Oliver J. Sutton, Qinghua Zhou, Wei Wang, Desmond J. Higham, Alexander N. Gorban, Alexander Bastounis, Ivan Tyukin:
Stealth edits to large language models. NeurIPS 2024 - [i10]Ivan Yu. Tyukin, Tatiana Tyukina, Daniël P. van Helden, Zedong Zheng, Evgeny M. Mirkes, Oliver J. Sutton, Qinghua Zhou, Alexander N. Gorban, Penelope M. Allison:
Weakly Supervised Learners for Correction of AI Errors with Provable Performance Guarantees. CoRR abs/2402.00899 (2024) - [i9]Oliver J. Sutton, Qinghua Zhou, Wei Wang, Desmond J. Higham, Alexander N. Gorban, Alexander Bastounis, Ivan Yu. Tyukin:
Stealth edits for provably fixing or attacking large language models. CoRR abs/2406.12670 (2024) - 2023
- [c4]Oliver J. Sutton, Alexander N. Gorban, Ivan Yu. Tyukin:
A Geometric View on the Role of Nonlinear Feature Maps in Few-Shot Learning. GSI (1) 2023: 560-568 - [c3]Oliver J. Sutton, Qinghua Zhou, Alexander N. Gorban, Ivan Yu. Tyukin:
Relative Intrinsic Dimensionality Is Intrinsic to Learning. ICANN (1) 2023: 516-529 - [c2]Alexander Bastounis, Alexander N. Gorban, Anders C. Hansen, Desmond J. Higham, Danil V. Prokhorov, Oliver J. Sutton, Ivan Yu. Tyukin, Qinghua Zhou:
The Boundaries of Verifiable Accuracy, Robustness, and Generalisation in Deep Learning. ICANN (1) 2023: 530-541 - [c1]Qinghua Zhou, Oliver J. Sutton, Yudong Zhang, Alexander N. Gorban, Valeri A. Makarov, Ivan Yu. Tyukin:
Neuromorphic tuning of feature spaces to overcome the challenge of low-sample high-dimensional data. IJCNN 2023: 1-8 - [i8]Paul Houston, Matthew E. Hubbard, Thomas J. Radley, Oliver J. Sutton, Richard S. J. Widdowson:
Efficient High-Order Space-Angle-Energy Polytopic Discontinuous Galerkin Finite Element Methods for Linear Boltzmann Transport. CoRR abs/2304.09592 (2023) - [i7]Oliver J. Sutton, Qinghua Zhou, Ivan Yu. Tyukin, Alexander N. Gorban, Alexander Bastounis, Desmond J. Higham:
How adversarial attacks can disrupt seemingly stable accurate classifiers. CoRR abs/2309.03665 (2023) - [i6]Alexander Bastounis, Alexander N. Gorban, Anders C. Hansen, Desmond J. Higham, Danil V. Prokhorov, Oliver J. Sutton, Ivan Yu. Tyukin, Qinghua Zhou:
The Boundaries of Verifiable Accuracy, Robustness, and Generalisation in Deep Learning. CoRR abs/2309.07072 (2023) - [i5]Oliver J. Sutton, Qinghua Zhou, Alexander N. Gorban, Ivan Yu. Tyukin:
Relative intrinsic dimensionality is intrinsic to learning. CoRR abs/2311.07579 (2023) - 2022
- [i4]Ivan Yu. Tyukin, Oliver J. Sutton, Alexander N. Gorban:
Learning from few examples with nonlinear feature maps. CoRR abs/2203.16935 (2022) - [i3]Oliver J. Sutton, Alexander N. Gorban, Ivan Yu. Tyukin:
Towards a mathematical understanding of learning from few examples with nonlinear feature maps. CoRR abs/2211.03607 (2022) - 2021
- [j3]Zhaonan Dong, Lorenzo Mascotto, Oliver J. Sutton:
Residual-Based A Posteriori Error Estimates for hp-Discontinuous Galerkin Discretizations of the Biharmonic Problem. SIAM J. Numer. Anal. 59(3): 1273-1298 (2021) - 2020
- [i2]Andrea Cangiani, Emmanuil H. Georgoulis, Oliver J. Sutton:
Adaptive non-hierarchical Galerkin methods for parabolic problems with application to moving mesh and virtual element methods. CoRR abs/2005.05661 (2020) - [i1]Zhaonan Dong, Lorenzo Mascotto, Oliver J. Sutton:
Residual-based a posteriori error estimates for hp-discontinuous Galerkin discretisations of the biharmonic problem. CoRR abs/2009.14140 (2020)
2010 – 2019
- 2017
- [j2]Oliver J. Sutton:
The virtual element method in 50 lines of MATLAB. Numer. Algorithms 75(4): 1141-1159 (2017) - [j1]Andrea Cangiani, Emmanuil H. Georgoulis, Tristan Pryer, Oliver J. Sutton:
A posteriori error estimates for the virtual element method. Numerische Mathematik 137(4): 857-893 (2017)
Coauthor Index
aka: Ivan Yu. Tyukin
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
