• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Generative Adversarial Networks Acceleration for LHCb RICH Detector

Student: Senchenko Timofey

Supervisor: Andrey Ustyuzhanin

Faculty: Faculty of Computer Science

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2021

Generative Adversarial Networks(GANs) are widely used today in various tasks of real data replication; however, strong quality performance of GANs is usually achieved through a significant increase of trainable parameters, which also increases computational complexity. This paper explores a way to accelerate a GAN used for particle generation for the LHCb RICH detector through compression of the model. The approach we use in this paper is called Knowledge Distillation; it allows us to train a shallow model with a smaller number of parameters using the initial heavyweight model as the teacher, without significant performance loss. The compressed models achieved in this project provide 37\% faster particle generation than the base model, with the number of trainable parameters reduced by 44\% while maintaining good score performance.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses