Shilpak Banerjee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shilpak Banerjee has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Philipp Kunde
Faculty of Mathematics and Computer Science, Jagiellonian University in Krakow, Krakow, Poland
4 shared publications - Koushik Biswas
Northwestern University
3 shared publications - Sandeep Kumar
IIIT Delhi
3 shared publications - Ashish Kumar Pandey
Department of Mathematics IIIT Delhi 110020 New Delhi India
2 shared publications - Daren Wei
Einstein Institute of Mathematics The Hebrew University of Jerusalem Givat Ram. Jerusalem 9190401 Israel
2 shared publications Ashish Kumar Pandey
IIIT Delhi
1 shared publication
Latest Publications
- Open Access
Weak mixing behavior for the projectivized derivative extension
In both smooth and analytic categories, we construct examples of diffeomorphisms of topological entropy zero with intricate ergodic properties. On any smooth compact connected manifold of dimension 2 admitting a nontrivial circle action, we construct a smooth diffeomorphism whose differential is weakly mixing with respect to a smooth measure in the projectivization of the tangent bundle. In case of the 2-torus, we also obtain the analytic counterpart of such a diffeomorphism. The constructions are based on a quantitative version of the ``Approximation by Conjugation'' method, which involves explicitly defined conjugation maps, partial partitions, and the adaptation of a specific analytic approximation technique.
Open AccessWeak mixing behavior for the projectivized derivative extension
In both smooth and analytic categories, we construct examples of diffeomorphisms of topological entropy zero with intricate ergodic properties. On any smooth compact connected manifold of dimension 2 admitting a nontrivial circle action, we construct a smooth diffeomorphism whose differential is weakly mixing with respect to a smooth measure in the projectivization of the tangent bundle. In case of the 2-torus, we also obtain the analytic counterpart of such a diffeomorphism. The constructions are based on a quantitative version of the ``Approximation by Conjugation'' method, which involves explicitly defined conjugation maps, partial partitions, and the adaptation of a specific analytic approximation technique.
- 9 October 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (4)
Ergodic and mixing quantum channels: From two-qubit to many-body quantum systems
- 9 October 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (4)
Ergodic and mixing quantum channels: From two-qubit to many-body quantum systems
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 43 (1) , 209-255
Slow entropy for some Anosov-Katok diffeomorphisms
The Anosov-Katok method is one of the most powerful tools of constructing smooth volume-preserving diffeomorphisms of entropy zero with prescribed ergodic or topological properties. To measure the complexity of systems with entropy zero, invariants like slow entropy have been introduced. In this article we develop several mechanisms facilitating computation of topological and measure-theoretic slow entropy of Anosov-Katok diffeomorphisms.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 43 (1) , 209-255
Slow entropy for some Anosov-Katok diffeomorphisms
The Anosov-Katok method is one of the most powerful tools of constructing smooth volume-preserving diffeomorphisms of entropy zero with prescribed ergodic or topological properties. To measure the complexity of systems with entropy zero, invariants like slow entropy have been introduced. In this article we develop several mechanisms facilitating computation of topological and measure-theoretic slow entropy of Anosov-Katok diffeomorphisms.
- 17 November 2022
- Published by Springer Nature in Journal d'Analyse Mathématique
- Vol. 148 (2) , 399-445
Real-analytic realization of Uniform Circular Systems and some applications
- 17 November 2022
- Published by Springer Nature in Journal d'Analyse Mathématique
- Vol. 148 (2) , 399-445
Real-analytic realization of Uniform Circular Systems and some applications
- 23 October 2022
- Published by Springer Nature
- p. 313-329
SAU: Smooth Activation Function Using Convolution with Approximate Identities
- 23 October 2022
- Published by Springer Nature
- p. 313-329
SAU: Smooth Activation Function Using Convolution with Approximate Identities
- Open Access
Slow entropy of some combinatorial constructions
Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we prove flexibility results for the values of upper and lower polynomial slow entropy of rigid transformations as well as maps admitting a good cyclic approximation. Moreover, we show that there cannot exist a general upper bound on the lower measure-theoretic slow entropy for systems of finite rank.
Open AccessSlow entropy of some combinatorial constructions
Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we prove flexibility results for the values of upper and lower polynomial slow entropy of rigid transformations as well as maps admitting a good cyclic approximation. Moreover, we show that there cannot exist a general upper bound on the lower measure-theoretic slow entropy for systems of finite rank.
- 7 September 2021
- Published by Springer Nature
- p. 260-272
EIS - Efficient and Trainable Activation Functions for Better Accuracy and Performance
- 7 September 2021
- Published by Springer Nature
- p. 260-272
EIS - Efficient and Trainable Activation Functions for Better Accuracy and Performance
- Open Access
- 16 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 120613-120623
TanhSoft—Dynamic Trainable Activation Functions for Faster Learning and Better Performance
Deep learning, at its core, contains functions that are the composition of a linear transformation with a non-linear function known as activation function. In the past few years, there is an increasing interest in the construction of novel activation functions resulting in better learning. In this work, we propose three novel activation functions with learnable parameters, namely TanhSoft-1, TanhSoft-2, and TanhSoft-3, which are shown to outperform several well-known activation functions. For instance, replacing ReLU with TanhSoft-1, TanhSoft-2, and Tanhsot-3 improves top-1 classification accuracy by 6.06%, 5.75%, and 5.38% respectively on VGG-16(with batch-normalization), by 3.02%, 3.25% and 2.93% respectively on PreActResNet-34 in CIFAR-100 dataset, by 1.76%, 1.93%, and 1.82% respectively on WideResNet 28-10 in Tiny ImageNet dataset. TanhSoft-1, TanhSoft-2, and Tanhsot-3 outperformed ReLU on mean average precision (mAP) by 0.7%, 0.8%, and 0.6% respectively in object detection problem on SSD 300 model in Pascal VOC dataset.
- 16 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 120613-120623
Open AccessTanhSoft—Dynamic Trainable Activation Functions for Faster Learning and Better Performance
Deep learning, at its core, contains functions that are the composition of a linear transformation with a non-linear function known as activation function. In the past few years, there is an increasing interest in the construction of novel activation functions resulting in better learning. In this work, we propose three novel activation functions with learnable parameters, namely TanhSoft-1, TanhSoft-2, and TanhSoft-3, which are shown to outperform several well-known activation functions. For instance, replacing ReLU with TanhSoft-1, TanhSoft-2, and Tanhsot-3 improves top-1 classification accuracy by 6.06%, 5.75%, and 5.38% respectively on VGG-16(with batch-normalization), by 3.02%, 3.25% and 2.93% respectively on PreActResNet-34 in CIFAR-100 dataset, by 1.76%, 1.93%, and 1.82% respectively on WideResNet 28-10 in Tiny ImageNet dataset. TanhSoft-1, TanhSoft-2, and Tanhsot-3 outperformed ReLU on mean average precision (mAP) by 0.7%, 0.8%, and 0.6% respectively in object detection problem on SSD 300 model in Pascal VOC dataset.
- 25 January 2018
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 39 (10) , 2643-2688
Real-analytic AbC constructions on the torus
In this article we demonstrate a way to extend the AbC (approximation by conjugation) method invented by Anosov and Katok from the smooth category to the category of real-analytic diffeomorphisms on the torus. We present a general framework for such constructions and prove several results. In particular, we construct minimal but not uniquely ergodic diffeomorphisms and non-standard real-analytic realizations of toral translations.
- 25 January 2018
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 39 (10) , 2643-2688
Real-analytic AbC constructions on the torus
In this article we demonstrate a way to extend the AbC (approximation by conjugation) method invented by Anosov and Katok from the smooth category to the category of real-analytic diffeomorphisms on the torus. We present a general framework for such constructions and prove several results. In particular, we construct minimal but not uniquely ergodic diffeomorphisms and non-standard real-analytic realizations of toral translations.