SearcharxivSearch

arXiv subjects

Liav Weiss

Publications and source records attributed to Liav Weiss.

2 recordsLinked to original sources

vLLM Semantic Router: Signal Driven Decision Routing for Mixture-of-Modality Models

As large language models (LLMs) diversify across modalities, capabilities, and cost profiles, the problem of intelligent request routing: selecting the right model for each query at inference time, has become a critical systems challenge. We present vLLM Semantic Router, a signal-driven decision routing framework for Mixture-of-Modality (MoM) model deployments. The architecture follows two complementary Shannon-inspired views. In the information-theoretic regime, signal extraction reduces the entropy of "which model?" by distilling routing-relevant information from raw queries. In the Boolean-algebraic regime, the decision engine composes functionally complete routing policies from signal conditions. The central innovation is composable signal orchestration: thirteen heterogeneous signal types, spanning sub-millisecond heuristics and neural classifiers for semantics, safety, and modality, are composed through configurable Boolean decision rules into deployment-specific routing policies, so that fundamentally different scenarios (multi-cloud enterprise, privacy-regulated, cost-optimized) are expressed as different configurations over the same architecture. Matched decisions drive semantic model routing via thirteen selection algorithms, while per-decision plugin chains enforce safety constraints including a three-stage HaluGate hallucination detection pipeline and a lightweight episodic memory system with ReflectionGate for personalized multi-turn context. A typed neural-symbolic DSL specifies these routing policies and compiles them to multiple deployment targets, enabling configuration-first adaptation without code changes. Together, these components show that composable signal orchestration enables a single framework to serve diverse deployment scenarios with differentiated cost, privacy, and safety policies.

cs.NI

Election of government ministers

The executive branch (the government) is usually not directly elected by the people, but is created by another elected body or person such as the parliament or the president. As a result, its members are not directly accountable to the people, individually or as a group. We propose a scenario where government members are directly elected by the people, and seek to achieve proportional representation in the process. We will present a formal model for the allocation of K offices, each associated with a disjoint set of candidates contesting for that seat. A group of voters provides ballots for each of the offices. Since using simple majority voting for each office independently may result in minority preferences being completely ignored, here we adapt the greedy version of proportional approval voting (GreedyPAV) to our framework. In the article Electing the Executive Branch you can find an in-depth explanation of the model and a demonstration - through computer-based simulations - of how voting for all offices together using this rule overcomes this weakness and upholds the axiom of proportionality. In this article, we will present the implementation of the algorithm (GreedyPAV) proposed by Rutvik Page, Ehud Shapiro, and Nimrod Talmon in the article mentioned above. In addition, we tested our implementation through a survey, the results of which will be presented and analyzed later in the article.

cs.CY