Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Florin Gogianu

dblp:230/0696 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Deep learning architectures and training · 50% Learning theory · 39% Reinforcement learning · 11%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
activation function
0.912025
Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wild · CVPR 2025
Machine learning › Deep learning architectures and training › activation function
activation function design
0.912025
Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wild · CVPR 2025
Machine learning › Learning theory
inductive bias
0.912025
Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wild · CVPR 2025
Machine learning › Learning theory › inductive bias
simplicity bias
0.912025
Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wild · CVPR 2025
Machine learning › Reinforcement learning
deep reinforcement learning
0.512021
Spectral Normalisation for Deep Reinforcement Learning: An Optimisation Perspective · ICML 2021
Machine learning › Deep learning architectures and training › normalization
spectral normalization
0.512021
Spectral Normalisation for Deep Reinforcement Learning: An Optimisation Perspective · ICML 2021

Methods — techniques the papers use, named apart from their topics

meta-learning · 0.9ReLU · 0.9GELU · 0.9spectral normalization · 0.5lipschitz constraint · 0.5
YearPublicationVenuePosition
2025 Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wild
abstract
Neural architectures tend to fit their data with relatively simple functions. This "simplicity bias" is widely regarded as key to their success. This paper explores the limits of this principle. Building on recent findings that the simplicity bias stems from ReLU activations [96], we introduce a method to meta-learn new activation functions and inductive biases better suited to specific tasks.Findings. We identify multiple tasks where the simplicity bias is inadequate and ReLUs suboptimal. In these cases, we learn new activation functions that perform better by inducing a prior of higher complexity. Interestingly, these cases correspond to domains where neural networks have historically struggled: tabular data, regression tasks, cases of shortcut learning, and algorithmic grokking tasks. In comparison, the simplicity bias induced by ReLUs proves adequate on image tasks where the best learned activations are nearly identical to ReLUs and GeLUs.Implications. Contrary to popular belief, the simplicity bias of ReLU networks is not universally useful. It is near-optimal for image classification, but other inductive biases are sometimes preferable. We showed that activation functions can control these inductive biases, but future tailored architectures might provide further benefits. Advances are still needed to characterize a model’s inductive biases beyond "complexity", and their adequacy with the data.
Damien Teney, Liangze Jiang, Florin Gogianu, Ehsan Abbasnejad
CVPR3
2021 Spectral Normalisation for Deep Reinforcement Learning: An Optimisation Perspective
abstract
Most of the recent deep reinforcement learning advances take an RL-centric perspective and focus on refinements of the training objective. We diverge from this view and show we can recover the performance of these developments not by changing the objective, but by regularising the value-function estimator. Constraining the Lipschitz constant of a single layer using spectral normalisation is sufficient to elevate the performance of a Categorical-DQN agent to that of a more elaborated agent on the challenging Atari domain. We conduct ablation studies to disentangle the various effects normalisation has on the learning dynamics and show that is sufficient to modulate the parameter updates to recover most of the performance of spectral normalisation. These findings hint towards the need to also focus on the neural component and its learning dynamics to tackle the peculiarities of Deep Reinforcement Learning.
Florin Gogianu, Tudor Berariu, Mihaela Rosca, Claudia Clopath, Lucian Busoniu, Razvan Pascanu
ICML1