◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Arijit Sehanobish

27 papers hereh-index 9299 citations33 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author10
  • middle author13
  • last author2

Across the 25 of 27 papers where every author was matched, so the position is known.

fields
  • cs.LG20
  • cs.CV2
  • cs.CL1
  • eess.IV1
  • eess.SP1
  • q-bio.GN1
same name
  • Arijit Sehanobish — 1 paper, h 0

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20192026
most citedSelf-supervised edge features for improved Graph Neural Network training

7 citations · 34 across the 25 of their papers we have counts for

collaborators
Showing 2026Show all

4 papers · 1 filter

cs.LG2026

Not How Many, But Which: Parameter Placement in Low-Rank Adaptation

Arijit Sehanobish, Charles Lovering

We study the \textit{parameter placement problem}: given a fixed budget of k trainable entries within the B matrix of a LoRA adapter (A frozen), does the choice of which k matt…

cs.LG2026

RelFlexformer: Efficient Attention 3D-Transformers for Integrable Relative Positional Encodings

Byeongchan Kim, Arijit Sehanobish, Avinava Dubey +2

We present a new class of efficient attention mechanisms applying universal 3D Relative Positional Encoding (RPE) methods given by arbitrary integrable modulation functions f. Th…

cs.LG2026

EUGens: Efficient, Unified, and General Dense Layers

Sang Min Kim, Byeongchan Kim, Arijit Sehanobish +7

Efficient neural networks are essential for scaling machine learning models to real-time applications and resource-constrained environments. Fully-connected feedforward layers (FFL…

cs.LG2026

SWING: Unlocking Implicit Graph Representations for Graph Random Features

Alessandro Manenti, Avinava Dubey, Arijit Sehanobish +2

We propose SWING: Space Walks for Implicit Network Graphs, a new class of algorithms for computations involving Graph Random Features on graphs given by implicit representations (i…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.