--- title: 'VariSAC: Optimization & V2X Connectivity Methods' url: https://www.emergentmind.com/topics/varisac type: topic --- # VariSAC: Optimization & V2X Connectivity Methods VariSAC denotes more than one unrelated construct in the arXiv literature. In one usage, it is a variance-reduced stochastic approximation method for composite empirical-risk minimization that performs variance reduction simultaneously over data indices and coordinate indices [1905.11266]. In another, it is a graph neural network-augmented Soft Actor-Critic framework for assured, time-continuous connectivity in RIS-aided, ISAC-enabled vehicle-to-everything systems [2509.06763]. A separate but similarly spelled method, VSAC, is a RANSAC-type robust estimator for homography and fundamental-matrix estimation and should not be conflated with either VariSAC usage [2106.10240]. ## 1. Nomenclature and scope The term is not monosemous. The supplied literature uses “VariSAC” in two technically distinct settings, and it also contains the closely related but different acronym “VSAC.” | Name | Domain | Core characterization | |---|---|---| | VariSAC | Optimization | Variance-reduced stochastic approximation over data and coordinates | | VariSAC | Wireless networking | V2X assured connectivity in RIS-aided ISAC via GNN-augmented reinforcement learning | | VSAC | Geometric vision | Efficient and accurate estimator for \(H\) and \(F\) | This terminological overlap is a common source of confusion. A plausible implication is that any technical discussion of VariSAC must specify the problem class immediately: convex composite optimization in the sense of regularized empirical risk minimization, or RIS-assisted V2X control in the sense of continuous-connectivity optimization. The 2021 VSAC paper belongs to neither category; it addresses two-view geometry, introduces independent inliers, adaptive SPRT, and Gaussian-elimination-based minimal solvers, and uses a different acronym without the “ri” component [2106.10240]. ## 2. VariSAC in composite empirical-risk minimization In the optimization usage, VariSAC is presented as a special case of a general variance-reduction framework for regularized empirical risk minimization [1905.11266]. The problem is \[ \min_{x\in\mathbb{R}^d} F(x) \quad\text{where}\quad F(x)=\frac1n\sum_{j=1}^n f_j(x)+\psi(x). \] The assumptions are explicit. Each \(f_j:\mathbb{R}^d\to\mathbb{R}\) is convex and \(L_j\)-smooth, where \(L_j\in\mathbb{R}^{d\times d}\) is positive semidefinite. The regularizer \(\psi\) is proper, closed, convex, and admits an easy proximal operator. The average objective \(f(x)=\tfrac1n\sum_j f_j(x)\) is \(\sigma\)-quasi-strongly-convex. The method uses the Jacobian matrix of partial gradients, \[ J(x)=\bigl[\nabla f_1(x)\;\;\nabla f_2(x)\;\dots\;\nabla f_n(x)\bigr]\in\mathbb{R}^{d\times n}, \] so that \(\nabla f(x)=\tfrac1n J(x)e\), with \(e\) the all-ones vector. The defining structural feature is the simultaneous maintenance of two sketches at every iteration: a “data” sketch \(S_{\rm data}^k\in\mathbb{R}^{n\times n}\) satisfying \(\mathbb{E}[S_{\rm data}^k]=I_n\), and a “coordinate” sketch \(S_{\rm coord}^k\in\mathbb{R}^{d\times d}\) satisfying \(\mathbb{E}[S_{\rm coord}^k]=I_d\). In the concrete sampling construction, a random subset \(R^k\subseteq\{1,\dots,n\}\) with \(\Pr[j\in R^k]=p_j\) induces \[ S_{\rm data}^k=\sum_{j\in R^k}\frac1{p_j}e_j e_j^\top, \] while a random coordinate subset \(L^k\subseteq\{1,\dots,d\}\) with \(\Pr[i\in L^k]=q_i\) induces \[ S_{\rm coord}^k=\sum_{i\in L^k}\frac1{q_i}E_{ii}. \] This gives unbiased projectors onto the chosen indices. The algorithm initializes \(x^0\in\mathbb{R}^d\) and \(J^0\in\mathbb{R}^{d\times n}\), samples \(R^k\) and \(L^k\), evaluates \(\{\nabla f_j(x^k)\}_{j\in R^k}\) and \(\{\partial_i f(x^k)\}_{i\in L^k}\), updates the Jacobian estimate by \[ J^{k+1}=J^k+\bigl(J(x^k)-J^k\bigr)S_{\rm data}^k, \] forms the gradient estimator \[ g^k=\frac1n J^k e+\frac1n S_{\rm coord}^k\bigl(J(x^k)-J^k\bigr)S_{\rm data}^k e, \] and then applies the proximal step \[ x^{k+1}=\mathrm{prox}_{\alpha\psi}\bigl(x^k-\alpha g^k\bigr). \] The paper states that \(\mathbb{E}[g^k]=\nabla f(x^k)\), so the estimator is unbiased. It also states that \(\mathrm{Var}(g^k)\to 0\) as \(k\to\infty\) because \(J^k\to J(x^*)\) and \(\nabla f_j(x^k)\to \nabla f_j(x^*)\). This places VariSAC within the class of memory-based variance-reduced proximal methods, but with an explicit coupling of data subsampling and coordinate subsampling. ## 3. Variance reduction, convergence theory, and reductions to known methods The derivation emphasizes sketch-and-project structure [1905.11266]. The Jacobian update is written as \[ J^{k+1} =\arg\min_{Z:\;Z\,S_{\rm data}^k=J(x^k)\,S_{\rm data}^k}\|Z-J^k\|_F^2 =J^k+\bigl(J(x^k)-J^k\bigr)S_{\rm data}^k. \] The gradient-estimation error is decomposed into an “old memory bias” term and a correction term, and the mean-square error is bounded by \[ \mathbb{E}\bigl\|g^k-\nabla f(x^k)\bigr\|^2 \le \frac{2}{n^2}\,\mathbb{E}\,\|J(x^k)-J(x^*)\|_F^2 + \frac{2}{n^2}\,\mathbb{E}\,\|J^k-J(x^*)\|_F^2. \] The main theorem gives linear convergence under the stated assumptions, together with additional structural conditions on a positive-definite weight operator \(W\) commuting with both sketches and on the initial Jacobian guess \(J^0\). With the Lyapunov function \[ \Psi^k = \|x^k-x^*\|^2 + \alpha\bigl\|W^{\tfrac12}(J^k-J(x^*))\bigr\|_F^2, \] the theorem concludes that \[ \mathbb{E}[\Psi^k]\le (1-\alpha\sigma)^k\Psi^0, \] that is, \(\Psi^k\) decays linearly at rate \(1-\alpha\sigma\). A defining theoretical feature is that several previously separate methods arise as special cases. If coordinate sketching is turned off, \(S_{\rm coord}=I\), VariSAC reduces to a mini-batch SAGA with arbitrary data sampling, with complexity \[ \mathcal{O}\!\Bigl(\Bigl\{\frac{1}{\tau}+\max_j\frac{L_j}{n\,\sigma}\Bigr\}\ln\frac1\epsilon\Bigr), \] where \(\tau=\mathbb{E}[|R^k|]\). If data sketching is turned off, \(S_{\rm data}=I\), VariSAC reduces to SEGA with arbitrary coordinate sampling, with complexity \[ \mathcal{O}\!\Bigl(\Bigl\{\frac{1}{\gamma}+\frac{\max_i m_i}{\sigma}\Bigr\}\ln\frac1\epsilon\Bigr), \] where \(\gamma=\mathbb{E}[|L^k|]\). In the fully combined case, the stated complexity is \[ \mathcal{O}\!\Bigl( \max\Bigl\{\frac{1}{\gamma},\; \frac{1}{\tau}+\max_{i,j}\frac{m_i^j}{n\,\sigma}\Bigr\} \ln\frac1\epsilon \Bigr). \] The practical guidance is likewise explicit. Data-sampling probabilities may be chosen as \(p_j\propto \mathrm{Trace}(L_j)\) or \(p_j\propto L_j\)-diagonal to minimize the ESO constant, while coordinate-sampling probabilities may be chosen as \(q_i\propto m_i\). The paper further states that with these choices VariSAC “automatically interpolates between SAGA (big \(\gamma\)) and SEGA (big \(\tau\)) and in all regimes enjoys the best-known linear rates.” This suggests that the method’s main contribution is not merely a new update rule, but a unifying abstraction in which data-side and coordinate-side variance reduction become instances of the same sketch-based mechanism. ## 4. VariSAC in RIS-aided ISAC-enabled V2X systems In the networking usage, VariSAC is a framework for assured, time-continuous connectivity in RIS-aided, ISAC-enabled V2X systems [2509.06763]. The stated motivation is that existing methods typically optimize either instantaneous physical-layer reliability or per-packet success in isolation, and do not simultaneously unify the continuous multiplexed semantics of V2I temporal reliability and V2V probabilistic latency-bounded delivery, nor capture the strong spatio-temporal dependencies induced by dynamic topologies, RIS reconfigurations, and heterogeneous node capabilities in urban vehicular environments. The system model contains one multi-antenna base station at \((X_B,Y_B,Z_B)\), one RIS with \(F\) passive reflecting elements at \((X_R,Y_R,Z_R)\), and \(V\) single-antenna vehicles, among which \(J\) are designated sensing targets. The spectrum is divided into \(V\) V2I subchannels and \(J\) sensing subchannels, while \(D\) V2V links reuse V2I subchannels through scheduling variables \(c_{v,d}^t\in\{0,1\}\). The RIS phase-shift matrix is \[ \Theta_t=\mathrm{diag}\bigl[\beta_1 e^{j\theta_1^t},\dots,\beta_F e^{j\theta_F^t}\bigr], \] with \(\theta_f^t\in\{0,2\pi/Q,\dots,2\pi(Q-1)/Q\}\) and amplitudes \(\beta_f\in[0,1]\). The communication model uses composite V2I and V2V channel gains. For V2I, \[ g_v^t=(g_{R,v}^t)^H\,\Theta_t\,g_{B,R}^t+g_{B,v}^t, \] and for V2V link \(d\), \[ g_d^t=(g_{R,B}^t)^H\,\Theta_t\,g_{d,R}^t+g_{d,B}^t. \] The corresponding SINRs are \[ \mathrm{SINR}_v^t =\frac{P_v|g_v^t|^2}{\sum_d c_{v,d}^t P_d^t|g_d^t|^2+\sigma_1^2}, \qquad \mathrm{SINR}_d^t =\frac{P_d^t|g_d^t|^2}{\sum_{d'} c_{v,d'}^t P_{d'}^t|g_{d'}^t|^2+P_v|g_v^t|^2+\sigma_1^2}, \] with rates \(R_v^t=W\log_2(1+\mathrm{SINR}_v^t)\) and \(R_d^t=W\log_2(1+\mathrm{SINR}_d^t)\). Sensing is modeled through \(\mathrm{SNR}_j^t\), subject to \(\mathrm{SNR}_j^t\ge \mathrm{SNR}_{\mathrm{th}}\). The central modeling contribution is the Continuous Connectivity Ratio (CCR). V2I continuity is defined through sliding-window indicators \(\Psi_v^t\) and \(\Psi_j^t\), while V2V connectivity is expressed as the delivery probability \[ \Pr\Bigl\{\sum_{t=1}^T c_{v,d}^t R_d^t \Delta t\ge K\Bigr\}. \] The unified CCR objective is \[ \mathrm{CCR} = \frac{1}{T}\sum_{t=1}^T \Bigl\{ \frac{1}{D}\sum_{d=1}^D \Pr(\cdots) + \frac{1}{V}\sum_{v=1}^V \Psi_v^t + \frac{1}{J}\sum_{j=1}^J \Psi_j^t \Bigr\}. \] The associated optimization problem maximizes this quantity over channel assignment \(\mathbf{C}\), power \(\mathbf{P}\), and RIS configuration \(\Theta\), subject to rate, SNR, channel-assignment, power, and phase-shift constraints. This formulation makes continuous reliability, rather than instantaneous throughput alone, the primary optimization target. ## 5. GNNRA architecture, SAC control, and optimization variables The control architecture combines a graph representation of the vehicular environment with entropy-regularized reinforcement learning [2509.06763]. Nodes are \(\{\)vehicles, BS, RIS\(\}\), and edges are \(\{\)V2I links, V2V links, sensing links\(\}\). Heterogeneous state vectors \(S_{veh}, S_{BS}, S_{RIS}\) are linearly projected to obtain \(\mathbf{H}^{(0)}\), after which a two-layer GCN with a residual adapter produces a flattened embedding \(S_{\mathrm{GNNRA}}\). The first graph-convolution layer is \[ \mathbf{H}^{(1)}=\sigma\bigl(\widetilde{\mathbf{A}}\,\mathbf{H}^{(0)}\,\mathbf{W}^{(0)}\bigr), \] with normalized adjacency matrix \(\widetilde{\mathbf{A}}\) and \(\sigma=\mathrm{ReLU}\). A bottleneck residual adapter is inserted to mitigate oversmoothing, and the second GCN layer is then applied to \(\mathbf{H}^{(1)}+f_{\mathrm{RA}}(\mathbf{H}^{(1)})\). The final representation is flattened and fed to a Soft Actor-Critic agent. The resource-allocation problem is cast as an MDP \((\mathcal{S},\mathcal{A},r,P)\). The state at slot \(t\) is \[ S_t=\bigl\{S_v(t),\,S_{BS}(t),\,S_{RIS}(t)\bigr\}_{v\in[1..V]}. \] Each vehicle state includes spatial coordinates, V2V channel and interference terms, remaining load, a sensing indicator, and a sensing channel if the indicator is active. The base-station state is \(S_{BS}(t)=(X_B,Y_B,\{g_v^t\}_{v=1}^V)\), and the RIS state is \(S_{RIS}(t)=(X_R,Y_R,\Theta^t)\). The action is \[ a_t=\bigl\{c_{v,d}^t,\;P_d^t,\;\Theta^t\bigr\}, \] so the agent jointly selects channel allocation, V2V power, and RIS configuration. The reward function is aligned with CCR: \[ r_t=\sum_{v=1}^V \Psi_v^t+\sum_{j=1}^J \Psi_j^t-\frac{1}{D}\sum_{d=1}^D \frac{K_d^t}{K}. \] The SAC objective is the standard maximum-entropy objective \[ J(\pi)=\mathbb{E}_{\tau\sim\pi}\Bigl[\sum_{t=0}^T \gamma^t r_t+\alpha\,\mathcal{H}\bigl(\pi(\cdot|s_t)\bigr)\Bigr], \] with explicit update rules for the temperature \(\alpha\), the critics, the actor, and the target critics. The paper’s algorithm pseudocode initializes GNNRA parameters, SAC networks, target critics, temperature \(\alpha\), and replay buffer \(B\); encodes each raw state with GNNRA; samples actions from the actor; stores transitions; updates the critics by minimizing \(L_Q(\theta_i)\); updates the actor via the stochastic policy gradient; updates \(\alpha\); and performs target-network soft updates. The stated design trade-offs are also integral to the method. GNNRA is described as critical for capturing heterogeneous, dynamic spatial relations among vehicles, BS, and RIS; the entropy term of Soft Actor-Critic is described as promoting robust exploration in the high-dimensional action space; the sliding-window length \(N\) trades off strictness of continuous V2I service against resource-allocation complexity; increasing V2I power improves continuous sensing and communication but intensifies V2V interference; and residual adapters mitigate GCN oversmoothing. ## 6. Empirical behavior, baselines, and terminological distinctions The two VariSAC usages are evaluated in entirely different empirical regimes. The optimization VariSAC is analyzed through convergence theory and complexity reductions to SAGA- and SEGA-type limits [1905.11266]. The V2X VariSAC is evaluated in simulation and on real-world trajectories [2509.06763]. In its reported setup, the environment is an urban road grid of size \(650\times 450\ \mathrm{m}^2\) with 12 vehicles, \(J=2\) sensing targets, one BS at \((180,270,25)\mathrm{m}\), and one RIS at \((290,380,25)\mathrm{m}\). Vehicle speeds lie in \([10,15]\ \mathrm{m/s}\), the V2V payload is \(K=8\times 10^6\) bits, the RIS has \(F=12\) elements and \(Q=8\) phase levels, V2I and sensing power is \(23\ \mathrm{dBm}\), V2V power ranges over \([1,\dots,23]\ \mathrm{dBm}\), the noise powers are \(\sigma_{1,2}^2=-114\ \mathrm{dBm}\), and the bandwidth is \(W=1\ \mathrm{MHz}\). The GNNRA module consists of three NodeEncoder networks and a two-layer GCN with one residual adapter, while the SAC module has an actor, two critics, and two targets, each with 5 fully-connected layers and 3 hidden layers of 512 units. Training uses 1,800 episodes, \(\gamma=0.99\), Adam optimizer learning rate \(3\times 10^{-4}\), replay buffer size \(10^6\), batch size \(10^6\), and target update \(\tau=0.01\). The baseline set is also specific: VariSAC-GNNRA-DDPG replaces SAC with DDPG; VariSAC-SAC omits GNNRA and feeds the raw state to SAC; VariSAC-RandomRIS uses random RIS phases; and VariSAC-Greedy performs myopic maximization of immediate reward. The reported metrics are \(\mathrm{CCR}_{\mathrm{V2I}}\), \(\mathrm{CCR}_{\mathrm{V2V}}\), and total CCR. The reported performance claims include the following: VariSAC achieves the fastest and most stable reward growth across learning rates \( \{10^{-4},3\times 10^{-4},5\times 10^{-4}\}\); when varying the V2V payload \(K\), total CCR gains over VariSAC-DDPG, RandomRIS, SAC-only, and Greedy are \(+8.4\%\), \(+10.2\%\), \(+10.6\%\), and \(+15.5\%\), respectively; under V2I transmit-power sweeps, total CCR outperforms baselines by \(6\%-18\%\); with longer window length \(N\), VariSAC still leads by up to \(+15.5\%\) in V2I CCR; and on Didi GAIA trajectories, V2V CCR gains over the best baselines are \(1.8\%-5.1\%\). A frequent misconception is to treat these results as informing the optimization-theoretic VariSAC of regularized empirical risk minimization. They do not. The two methods share a name but not a problem statement, objective, state representation, convergence analysis, or evaluation protocol. A second misconception is to identify VariSAC with the vision method VSAC. That is likewise incorrect: VSAC is a RANSAC-type estimator for homography and fundamental-matrix estimation, with independent inliers, adaptive SPRT, lightweight local optimization, Gaussian-elimination solvers, and DEGENSAC\(^+\), and is experimentally reported to run in \(1\!-\!2\) ms on a CPU across EVD, HPatches, PhotoTourism, and Kusvod2 [2106.10240]. This suggests that “VariSAC” is best understood not as a single algorithmic lineage, but as a reused acronym whose meaning is determined entirely by domain context. Source: https://www.emergentmind.com/topics/varisac