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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nisal Ranasinghe

dblp:248/5036 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0001-7250-5225ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
1 paper
Trustworthy machine learning · 67% Knowledge representation and reasoning · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
0.812024
GINN-LP: A Growing Interpretable Neural Network for Discovering Multivariate Laurent Polynomial Equations · AAAI 2024
Machine learning › Trustworthy machine learning › interpretability › explainable AI
interpretable neural network
0.812024
GINN-LP: A Growing Interpretable Neural Network for Discovering Multivariate Laurent Polynomial Equations · AAAI 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning
symbolic regression
0.812024
GINN-LP: A Growing Interpretable Neural Network for Discovering Multivariate Laurent Polynomial Equations · AAAI 2024

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

sparsity regularization · 0.8neural network growth · 0.8ensemble methods · 0.8
YearPublicationVenuePosition
2024 GINN-LP: A Growing Interpretable Neural Network for Discovering Multivariate Laurent Polynomial Equations
abstract
Traditional machine learning is generally treated as a black-box optimization problem and does not typically produce interpretable functions that connect inputs and outputs. However, the ability to discover such interpretable functions is desirable. In this work, we propose GINN-LP, an interpretable neural network to discover the form and coefficients of the underlying equation of a dataset, when the equation is assumed to take the form of a multivariate Laurent Polynomial. This is facilitated by a new type of interpretable neural network block, named the “power-term approximator block”, consisting of logarithmic and exponential activation functions. GINN-LP is end-to-end differentiable, making it possible to use backpropagation for training. We propose a neural network growth strategy that will enable finding the suitable number of terms in the Laurent polynomial that represents the data, along with sparsity regularization to promote the discovery of concise equations. To the best of our knowledge, this is the first model that can discover arbitrary multivariate Laurent polynomial terms without any prior information on the order. Our approach is first evaluated on a subset of data used in SRBench, a benchmark for symbolic regression. We first show that GINN-LP outperforms the state-of-the-art symbolic regression methods on datasets generated using 48 real-world equations in the form of multivariate Laurent polynomials. Next, we propose an ensemble method that combines our method with a high-performing symbolic regression method, enabling us to discover non-Laurent polynomial equations. We achieve state-of-the-art results in equation discovery, showing an absolute improvement of 7.1% over the best contender, by applying this ensemble method to 113 datasets within SRBench with known ground-truth equations.
Nisal Ranasinghe, Damith A. Senanayake, Sachith Seneviratne, Malin Premaratne, Saman K. Halgamuge
AAAI1
2019 SMPTE ST 2110 Compliant Scalable Architecture on FPGA for end to end Uncompressed Professional Video Transport Over IP Networks
abstract
SMTPE ST 2110 is a professional video over IP standard which enables uncompressed video to be transported as separate video, audio and ancillary data streams, allowing true flexibility in media workflows. Uncompressed video transmission allows professional video environments to achieve high quality video distribution while meeting strict latency requirements. Although this standard can be implemented on software, hardware solutions can achieve superior performance, lower latency and lower power consumption while efficiently handling jitter and packet bursts. This paper presents an FPGA based hardware implementation of a SMPTE ST 2110 compliant end to end solution supporting uncompressed video resolutions of up to 4K at 30fps. Due to its scalability, the architecture can be easily extended to support higher video resolutions and/or multiple video streams. Additionally, the interface modularity of the architecture enables integration with any video interface type. In this work, a Serial Digital Interface (SDI) interface is used. The proposed architecture consists of a replicable video processing pipeline for each stream, a Session Description Protocol (SDP) compliant network configuration unit and a SMPTE ST 2059-1/2 compliant time synchronization unit common to all streams, with network access via a 10G UDP/IPv4/Ethernet stack. All modules other than the Ethernet core and SDI interface modules can operate at 200MHz even though 4K 30fps video processing can be achieved with a minimum operating frequency of 100MHz.
Nisal Ranasinghe, Ravindu Bangamuarachchi, Jayath Seneviratne, Achini Jayawardane, Ajith Pasqual, R. M. A. U. Senarath
ASAP1