SearcharxivSearch

arXiv subjects

Ali Azimi

Publications and source records attributed to Ali Azimi.

12 recordsLinked to original sources

Before Parc Ferm\'e: RL-Time Pruning for Efficient Embodied LLMs in Autonomous Driving

Embodied Large Language Models (LLMs) are increasingly used as reasoning modules in robotic control pipelines to improve human-robot interaction, but their memory and generation latency make real-time deployment difficult. Pruning can reduce these costs, but for controllers that undergo multiple pre- and post-training phases, the crucial question is not only how much to prune, but when pruning should occur. In this work, we propose Before Parc Ferm\'e (BPF), a pruning strategy performed during RL that compresses embodied LLM controllers while they are still being optimized for closed-loop behavior. This allows pruning decisions to account for the task-specific supervision and closed-loop feedback that shape the final controller. We propose two variants: BPF-RL, which performs iterative pruning during RL by removing part of the model at predefined training intervals, and BPF-SFT/RL, which first prunes part of the model structure during SFT and then further compresses it during RL using the same iterative strategy as BPF-RL until the target pruning ratio is reached. We evaluate BPF on RobotxR1, an LLM-based autonomous-driving control pipeline, using an established LLM pruning framework (LLM-Pruner), and compare it against post-training pruning, post-training pruning with RL recovery, SFT-stage pruning, and smaller dense models from the same family. Our results show that BPF provides the best task-performance vs. memory and throughput trade-off among the considered pruning strategies. When compressing the larger RobotxR1 models, BPF-SFT/RL achieves a $1.69\times$ better size-end-to-end performance trade-off than directly selecting a smaller dense model from the same family, measured as removed parameters per lost percentage point of control adaptability. On the Jetson AGX Orin mounted on the target robotic platform, the compact models improve decode throughput by up to $27\%$.

cs.RO

Photonics in Flatland: Challenges and Opportunities for Nanophotonics with 2D Semiconductors

Two-dimensional (2D) semiconductors are emerging as a versatile platform for nanophotonics, offering unprecedented tunability in optical properties through exciton resonance engineering, van der Waals heterostructuring, and external field control. These materials enable active optical modulation, single-photon emission, quantum photonics, and valleytronic functionalities, paving the way for next-generation optoelectronic and quantum photonic devices. However, key challenges remain in achieving large-area integration, maintaining excitonic coherence, and optimizing amplitude-phase modulation for efficient light manipulation. Advances in fabrication, strain engineering, and computational modelling will be crucial to overcoming these limitations. This perspective highlights recent progress in 2D semiconductor-based nanophotonics, emphasizing opportunities for scalable integration into photonics.

physics.optics

The maximum four point condition matrix of a tree

$\newcommand{\Max}{\mathrm{Max4PC}}$ The Four point condition (4PC henceforth) is a well known condition characterising distances in trees $T$. Let $w,x,y,z$ be four vertices in $T$ and let $d_{x,y}$ denote the distance between vertices $x,y$ in $T$. The 4PC condition says that among the three terms $d_{w,x} + d_{y,z}$, $d_{w,y} + d_{x,z}$ and $d_{w,z} + d_{x,y}$ the maximum value equals the second maximum value. We define an $\binom{n}{2} \times \binom{n}{2}$ sized matrix $\Max_T$ from a tree $T$ where the rows and columns are indexed by size-2 subsets. The entry of $\Max_T$ corresponding to the row indexed by $\{w,x\}$ and column $\{y,z\}$ is the maximum value among the three terms $d_{w,x} + d_{y,z}$, $d_{w,y} + d_{x,z}$ and $d_{w,z} + d_{x,y}$. In this work, we determine basic properties of this matrix like rank, give an algorithm that outputs a family of bases, and find the determinant of $\Max_T$ when restricted to our basis. We further determine the inertia and the Smith Normal Form (SNF) of $\Max_T$.

math.CO

Steiner distance matrix of caterpillar graphs

For a connected graph $G:=(V,E)$, the Steiner distance $d_G(X)$ among a set of vertices $X$ is the minimum size among all the connected subgraphs of $G$ whose vertex set contains $X$. The $k-$Steiner distance matrix $D_k(G)$ of $G$ is a matrix whose rows and columns are indexed by $k-$subsets of $V$. For $k$-subsets $X_1$ and $X_2$, the $(X_1,X_2)-$entry of $D_k(G)$ is $d_G(X_1 \cup X_2)$. In this paper, we show that the rank of $2-$Steiner distance matrix of a caterpillar graph on $N$ vertices and with $p$ pendant veritices is $2N-p-1$.

math.CO

Factorization graphs of finite groups

We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization graphs. Also, we obtain a classification of all groups with claw-free, $K_{1,4}$-free, and square-free factorization graphs, excluding the non-solvable groups in the latter case.

math.GR

Self 2-distance graphs

All finite simple self $2$-distance graphs with no $4$-cycle, diamond, or triangles with a common vertex are determined. Utilizing these results, it is shown that there is no cubic self $2$-distance graphs.

math.CO

Cycles and paths in Jacobson graphs

All finite Jacobson graphs with a Hamiltonian cycle or path, or Eulerian tour or trail are determined, and it is shown that a finite Jacobson graph is Hamiltonian if and only if it is pancyclic. Also, the length of the longest induced cycles and paths in finite Jacobson graphs are obtained.

math.AC

On cycles in intersection graph of rings

Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. We show that such graphs are indeed pancyclic.

math.AC

Isomorphisms between Jacobson graphs

Let $R$ be a commutative ring with a non-zero identity and $\mathfrak{J}_R$ be its Jacobson graph. We show that if $R$ and $R'$ are finite commutative rings, then $\mathfrak{J}_R\cong\mathfrak{J}_{R'}$ if and only if $|J(R)|=|J(R')|$ and $R/J(R)\cong R'/J(R')$. Also, for a Jacobson graph $\mathfrak{J}_R$, we obtain the structure of group $\mathrm{Aut}(\mathfrak{J}_R)$ of all automorphisms of $\mathfrak{J}_R$ and prove that under some conditions two semi-simple rings $R$ and $R'$ are isomorphic if and only if $\mathrm{Aut}(\mathfrak{J}_R)\cong\mathrm{Aut}(\mathfrak{J}_{R'})$.

math.AC

Applying the Apriori algorithm for investigating the relationships between demographic characteristics of Iranian top 100 enterprises and the strcture of their commercial website

This study was conducted with the main aim to investigate the relationships between demographic characteristics of companies and the facilities required for their commercial websites. The research samples are the top 100 Iranian companies as ranked by the Iranian Industrial Management Institute; the method applied is datamining, using Association Rules throught the Apriori algorithms. To collect the data, an aithor-modified check list has been utilized, coverig the three areas of faclities within commercial websites, i.e. fundamental, information-providing, and service-delivering facilities. having extracted the association rules between the mentioned two sets of variables, 68 rules with a confidence rate of 90% and above were obtained, and based on their significance were classified into two groups of must-have and should-have requirements; a recommended package of facilities is hitherto offered to other companies which intend to enter e-commerce through their commerical websites with regards to each company's unique demographic characteristics.

cs.DB