Arno Solin

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Kalle Kujanpää

> Home > Persons > Arno Solin

Publications

2025
[c66]
- view
  - electronic edition @ openreview.net (open access)
  - details & citations
- export record
  dblp key:
  - conf/iclr/ScannellNK0LSP25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclr/ScannellNK0LSP25
Aidan Scannell, Mohammadreza Nakhaeinezhadfard, Kalle Kujanpää, Yi Zhao, Kevin Sebastian Luck, Arno Solin, Joni Pajarinen:
Discrete Codebook World Models for Continuous Control. ICLR 2025
[i79]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2503-00653
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2503-00653
Aidan Scannell, Mohammadreza Nakhaei, Kalle Kujanpää, Yi Zhao, Kevin Sebastian Luck, Arno Solin, Joni Pajarinen:
Discrete Codebook World Models for Continuous Control. CoRR abs/2503.00653 (2025)
2024
[i67]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2406-02696
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2406-02696
Aidan Scannell, Kalle Kujanpää, Yi Zhao, Mohammadreza Nakhaei, Arno Solin, Joni Pajarinen:
iQRL - Implicitly Quantized Representations for Sample-efficient Reinforcement Learning. CoRR abs/2406.02696 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.