Glatt Ruben

Dr. Glatt Ruben

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 August 2024 in Applied Energy
Verified
Journal Article
Closed access
ZLZeyu Liang
Zeyu Liang
TQTao Qian
Tao Qian
MKMert Korkali
Mert Korkali
GRGlatt Ruben
Glatt Ruben
Qinran HuQinran Hu
Qinran Hu

4 July 2024 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Open access
FFF. O. de Franca
F. O. de Franca
MVM. Virgolin
M. Virgolin
MKM. Kommenda
M. Kommenda
MMM. S. Majumder
M. S. Majumder
MCM. Cranmer
M. Cranmer
WCW. G. La Cava
W. G. La Cava
Symbolic regression (SR) searches for analytic expressions that accurately describe studied phenomena. The main promise of this approach is that it may return an interpretable model that can be insightful to users, while maintaining high accuracy. The current standard for benchmarking these algorithms is SRBench, which evaluates methods on hundreds of datasets that are a mix of real-world and simulated processes spanning multiple domains. At present, the ability of SRBench to evaluate interpretability is limited to measuring the size of expressions on real-world data, and the exactness of model forms on synthetic data. In practice, model size is only one of many factors used by subject experts to determine how interpretable a model truly is. Furthermore, SRBench does not characterize algorithm performance on specific, challenging subtasks of regression, such as feature selection and evasion of local minima. In this work, we propose and evaluate an approach to benchmarking SR algorithms that addresses these limitations of SRBench by 1) incorporating expert evaluations of interpretability on a domain-specific task, and 2) evaluating algorithms over distinct properties of data science tasks. We evaluate 12 modern SR algorithms on these benchmarks and present an in-depth analysis of the results, discuss current challenges of SR algorithms and highlight possible improvements for the benchmark itself.

28 December 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
FSFelipe Leno Da Silva
Felipe Leno Da Silva
GRGlatt Ruben
Glatt Ruben
Anna Helena Reali CostaAnna Helena Reali Costa
Anna Helena Reali Costa
Reinforcement learning (RL) is a widely known technique to enable autonomous learning. Even though RL methods achieved successes in increasingly large and complex problems, scaling solutions remains a challenge. One way to simplify (and consequently accelerate) learning is to exploit regularities in a domain, which allows generalization and reduction of the learning space. While object-oriented Markov decision processes (OO-MDPs) provide such generalization opportunities, we argue that the learning process may be further simplified by dividing the workload of tasks amongst multiple agents, solving problems as multiagent systems (MAS). In this paper, we propose a novel combination of OO-MDP and MAS, called multiagent OO-MDP (MOO-MDP). Our proposal accrues the benefits of both OO-MDP and MAS, better addressing scalability issues. We formalize the general model MOO-MDP and present an algorithm to solve deterministic cooperative MOO-MDPs. We show that our algorithm learns optimal policies while reducing the learning space by exploiting state abstractions. We experimentally compare our results with earlier approaches in three domains and evaluate the advantages of our approach in sample efficiency and memory requirements.

1 October 2020 in Expert Systems with Applications
Verified
Journal Article
Closed access
GRGlatt Ruben
Glatt Ruben
FSFelipe Leno Da Silva
Felipe Leno Da Silva
RBReinaldo A. C. Bianchi
Reinaldo A. C. Bianchi
Anna Helena Reali CostaAnna Helena Reali Costa
Anna Helena Reali Costa

14 August 2023 in IEEE Journal of Emerging and Selected Topics in Industrial Electronics
Verified
Journal Article
Closed access
FSFelipe Leno da Silva
Felipe Leno da Silva
GRGlatt Ruben
Glatt Ruben
Wencong SuWencong Su
Wencong Su
Van-Hai BuiVan-Hai Bui
Van-Hai Bui
FCFangyuan Chang
Fangyuan Chang
RZRong Zeng
Rong Zeng
Power converters are pervasive in modern electronic component design. They can be found in all electronic devices from household appliances and cellphone chargers to vehicles. Currently, designing new circuit topologies is hard because it requires human expertise based on experience and is difficult to automate. However, artificial-intelligence-assisted design can significantly facilitate the development of new power converters and/or improve the final result. Intelligently designed highly efficient power converters can have a significant effect on many important attributes, such as power efficiency, layout size, cost, heat dissemination, energy requirements, etc. We propose Autonomous Topology Generator (AutoTG) , a reinforcement-learning-based framework that generates power converter topology candidates based on user specifications, optimized for user preferences. By modeling power converter design as a symbolic optimization problem, we sequentially sample components in an autoregressive manner until new topologies are formed, providing both the topology specification and the sizing (magnitude of each component parameter) of the proposed power converter. We provide an empirical evaluation and show that AutoTG is able to generate varied high-efficiency topologies within component restrictions based on user input and show that previously unknown topologies can be found for further evaluation.

2 October 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
DHDonté Harris
Donté Harris
FSFelipe Leno Da Silva
Felipe Leno Da Silva
Wencong SuWencong Su
Wencong Su
GRGlatt Ruben
Glatt Ruben
As the use of combustion engine vehicles plays a deciding role in global warming, we can observe a trend to replace them with electric vehicles (EV) driven by new environmentally conscious policies and increasing technological capabilities. With improvements in driving range and reduction in prices come new challenges that may hamper the progress towards complete battery driven transportation. A major challenge for the increasing EV adoption is the planning of extensions to existing infrastructure or the inclusion of new infrastructure components in the planning process. This demands increasingly complex planning tools that can simulate the interplay between different stakeholders in modern transportation scenarios such as EVs, charging stations, energy providers, and general transportation participants. Simulation platforms for agent-based modeling in transportation have been developed as effective interactive tools that allow planners to explore different trade-offs across different scenarios with the ability to simulate the impact of policy or infrastructure decisions on the different stakeholders in the simulation. This article surveys several of the major simulation platforms that include modern EV-based forms of transportation and allow the simulation of relevant infrastructure components alongside the well established transportation simulations. These tools allow researchers to analyze expected traffic flow, identify possible charging station locations based on area demand, predict electrical grid demand, and more. This survey intends to make it easier for researchers to identify and apply a simulation platform in the context of supporting the increasing electrification of the transportation sector, enabling more efficient simulation and planning capabilities in this domain.