Searcharxiv⌕ Search

arXiv subjects

Search papers

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

At least 37 records · Page 2Linked to original sources

Where to Sample: Rethinking ML-Based Malicious Traffic Detection at Terabit Scale

Machine Learning (ML)-based malicious traffic detectors can identify unseen attacks, including in encrypted traffic, but scaling them to Terabit rates remains challenging. Packet sampling, commonly used to meet processing limits, can discard essential behavioral information and render detection ineffective. We present Peregrine, a hardware-software co-designed architecture built around a simple principle: compute features before sampling. Peregrine updates ML features over all traffic at line rate in a programmable switch, then downsamples the feature records sent to software inference. We instantiate this design with two detectors that impose distinct feature-computation requirements on the switch. Across 84 attack traces from three datasets, we show that approximate features computed over all packets can outperform exact features computed from sampled packets. In our evaluation, Peregrine preserves detection effectiveness while reducing feature-record rates by three orders of magnitude - even where pre-feature sampling causes detection to collapse.

cs.NI↗

On the rank of the double cohomology of moment-angle complexes

In [6], the authors construct a cochain complex $C\!H^*(\mathcal{Z}_{\mathcal{K}})$ on the cohomology of a moment-angle complex $\mathcal{Z}_{\mathcal{K}}$ and call the resulting cohomology the double cohomology, $H\!H^*(\mathcal{Z}_{\mathcal{K}})$. In this paper, we study the change of rank in double cohomology after gluing an $n$-simplex to a simplicial complex $\mathcal{K}$ in certain conditions. As an application, we give a positive answer to an open problem in [6]: For any even integer $r$, there always exists a simlicial complex $\mathcal{K}$ such that $\operatorname{rank} H\!H^*(\mathcal{Z}_{\mathcal{K}})=r$.

math.AT↗

Adaptive Momentum Benefits Score-based Generative Models

Score-based Generative Models (SGMs) have achieved remarkable success in generation tasks by establishing a diffusion process that gradually perturbs real data into Gaussian noise and then learning a reverse process to reconstruct the data from noise. However, conventional denoising methods, such as Langevin dynamics and numerical stochastic differential equation solvers, rely on randomness but suffer from slow generation speeds due to the high number of score function evaluations. To address this, we propose a plug-and-play Markov adaptive momentum sampling method, inspired by the strong connection between the SGMs' sampling process and stochastic gradient descent optimization. Our approach accelerates the transformation process without introducing additional hyperparameters. Theoretically, we establish a rigorous foundation by analyzing the relationship between the distribution of samples generated by our method and the original data distribution. This provides a novel perspective on the analysis of sampling distributions. Empirically, our method demonstrates superior efficiency, generating high-quality images/graphs in significantly fewer sampling steps, achieving a speedup of 2x to 5x while maintaining or surpassing baseline performance on various image and graph generation benchmarks. These results underscore the effectiveness of adaptive momentum in enhancing the efficiency of SGMs.

cs.LG↗

Logic-Based Benders Decomposition for Time Slot Management with Mixed Logit Demand

This paper develops an exact solution framework for the choice-based time slot management problem under mixed logit demand in attended home delivery systems. The problem jointly optimizes delivery slot offerings, price discounts, and routing decisions, with customer choices endogenously modeled through a simulation-based mixed logit formulation embedded via sample average approximation, resulting in a large-scale stochastic mixed-integer program. To address this complexity, we propose a logic-based Benders decomposition (LBBD) that separates strategic assortment and pricing decisions, together with customer choice, from scenario-specific vehicle routing subproblems. We derive problem-specific optimality cuts that exploit the routing structure to provide stronger bounds than generic cuts, and establish their validity. To enhance computational performance, we introduce and systematically evaluate several strengthening strategies, including relaxation-based cut generation and capacity- and flow-based valid inequalities. We further compare two equivalent encodings of the embedded choice model and show that the relative value of each strengthening strategy depends on the strength of the master formulation it complements. Computational experiments on benchmark instances show that the proposed framework significantly extends the range of solvable instances compared to direct MILP approaches. The framework is exact: it converges to a proven optimal solution given sufficient time, and the bounds it produces at intermediate iterations are valid. Within a 12-hour limit, proven optimality is reached for instances with up to 10 customers, and valid bounds are obtained up to 40 customers, including sizes at which the direct MILP formulation returns no feasible solution.

math.OC↗

Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning

We study a multi-round mechanism design problem, where we interact with a set of agents over a sequence of rounds. We wish to design an incentive-compatible (IC) online learning scheme to maximize an application-specific objective within a given class of mechanisms, without prior knowledge of the agents' type distributions. Even if each mechanism in this class is IC in a single round, if an algorithm naively chooses from this class on each round, the entire learning process may not be IC against non-myopic buyers who appear over multiple rounds. On each round, our method randomly chooses between the recommendation of a weakly differentially private online learning algorithm (e.g., Hedge), and a commitment mechanism which penalizes non-truthful behavior. Our method is IC and achieves $O(T^{\frac{1+h}{2}})$ regret for the application-specific objective in an adversarial setting, where $h$ quantifies the long-sightedness of the agents. When compared to prior work, our approach is conceptually simpler,it applies to general mechanism design problems (beyond auctions), and its regret scales gracefully with the size of the mechanism class.

cs.GT↗

On Hölder continuity and $p^\mathrm{th}$-variation function of Weierstrass-type functions

We study Hölder continuity, $p^\mathrm{th}$-variation function and Riesz variation of Weierstrass-type functions along the sequence of b-adic partitions, where b>1 is an integer. By a Weierstrass-type function, we mean that in the definition of the well-known Weierstrass function, the power function is replaced by a submultiplicative function, and the Lipschitz continuous cosine and sine functions are replaced by a general periodic Hölder continuous function.

math.CA↗

She Works, He Works: A Curious Exploration of Gender Bias in AI-Generated Imagery

She Works, He Works is an interdisciplinary project that combines feminist visual theory, AI critique, and artistic practice to examine gender representation in AI-generated imagery. By juxtaposing text-to-image outputs of male and female construction workers, it reveals how societal biases manifest in generative AI systems. The study employs critically crafted prompts that blend traditionally gendered traits with unconventional contexts, exposing disparities in representation-emphasizing aesthetics and agility for women versus authority and professionalism for men. Grounded in Griselda Pollock's feminist insights on visual culture, the project positions AI as both a technological and cultural actor, capable of perpetuating stereotypes and enabling critique. As both a study and an artwork, the project underscores the transformative potential of AI to reimagine gender norms and inspire equitable narratives. It highlights the ethical implications of AI in creative industries, calling for transparent practices, diverse datasets, and reflexive engagement with AI's cultural impact. Through its integration of critical analysis and artistic exploration, She Works, He Works contributes to broader discussions on inclusive AI development and the role of art in fostering societal change. This dual approach showcases the power of AI as a medium for critique and a tool for envisioning more just and inclusive futures.

cs.CY↗

Tensor-network simulation of quantum phase estimation in the von Neumann measurement formulation with DMRG-prepared initial states

The von Neumann measurement formulation of quantum phase estimation [Phys.\ Rev.\ A \textbf{66}, 032314 (2002); Quantum \textbf{5}, 465 (2021)] estimates energies by coupling the system to a discretized pointer register through $\hat H\otimes\hat p$ and reading out the pointer after an inverse quantum Fourier transform. Building on these works, we develop a tensor-network framework for simulating and benchmarking this protocol when the system is initialized in a matrix product state (MPS) pre-trained with the density matrix renormalization group (DMRG). The system and the pointer are represented as a composite MPS, the coupling $\hat H\otimes\hat p$ as a matrix product operator, and the coupled dynamics is evolved with the time-dependent variational principle. This gives direct access to the time-resolved pointer distribution, the recovered energy, and the entanglement generated between system and pointer. We apply the framework to quantum many-body spin systems and to electronic-structure problems. For the systems studied, the pointer readout yields accurate ground-state energy estimates from DMRG-prepared approximate states, even when their variational energies are not fully converged. These states generally contain contributions from both ground and excited eigenstates, with their spectral weights determining the corresponding contributions to the pointer distribution. More accurate initial states also strongly suppress the entanglement generated between system and pointer. We also provide logical and compiled resource estimates for a Suzuki--Trotter realization of the protocol.

quant-ph↗

A Comparative Study of Convolutional and Recurrent Neural Networks for Storm Surge Prediction in Tampa Bay

In this paper, we compare the performance of three popular deep learning architectures: Long Short-Term Memory (LSTM), Convolutional Neural Networks (CNN), and CNN-LSTM in water level prediction over different time window sizes. We used wind, pressure, and tide data from National Oceanic and Atmospheric Administration (NOAA) stations. Our results show that the LSTM model generally outperformed the other models in forecasting water level trends. By applying LSTM, we achieved a mean squared error (MSE) of 0.006, making it the most reliable option for real-world use. We predicted water levels using wind, pressure, and tides. Wind, pressure, and tide data are time-based features that lack spatial patterns. Consequently, LSTM performed better than spatial methods, such as CNN. We also investigated Hurricane Ian, which occurred in Tampa Bay in September 2022 and caused a significant storm surge. Our findings show that CNN and CNN-LSTM performed slightly better than LSTMs during powerful storms, such as hurricanes. Hurricanes are seldom observed in training data, and CNN-based models are more reliable when predicting data that were not included in the training. To explain how environmental factors affect the predicted water level, we used the perturbation method. The perturbation shows that the tide is more effective at predicting water levels than wind and pressure. This study demonstrates the potential of deep learning to improve storm surge prediction accuracy.

cs.LG↗

Silent Orbits and Cancellations in the Wave Trace

This paper shows that the wave trace of a bounded and strictly convex planar domain may be arbitrarily smooth in a neighborhood of some point in the length spectrum. In other words, the Poisson relation, which asserts that the singular support of the wave trace is contained in the closure of $\pm$ the length spectrum, can almost be made into a strict inclusion. To do so, we construct large families of domains for which there exist multiple periodic billiard orbits having the same length but different Maslov indices. Using the microlocal Balian-Bloch-Zelditch parametrix for wave invariants developed in our previous paper, we solve a large system of equations for the boundary curvature jets, which leads to the required cancellations. We call such periodic orbits silent, since they are undetectable from the ostensibly audible wave trace. Such cancellations show that there are potential limitations in using the wave trace for inverse spectral problems and, more fundamentally, that the Laplace spectrum and the length spectrum are inherently different mathematical objects, at least insofar as the wave trace is concerned.

math.SP↗

Unusual portals to new exotics, the $W$-gluon portal

We explore models where new light exotic (LEX) states interact with the Standard Model (SM) through the $W$-gluon portal, an asymmetric di-boson portal. The complete set of effective operators up to dimension six which couple a single LEX state to at least one $W$ boson and one gluon is considered. Other Standard Model particles may also be present in the interactions. We show that the $W$-gluon portal allows us to access a large array of exotic states in non-trivial representations of SU(3)$_\text{c}$ and SU(2)$_\text{L}$. New single production collider modes and phenomenological signatures for these light exotic states at the LHC and $ep$ colliders are discussed.

hep-ph↗

Matching-LLM: Historically Anchored Synthetic Prediction of Public Opinion and Elections

Large language models (LLMs) offer new opportunities for predicting public opinion and electoral behavior, but their synthetic responses may not fully reflect human attitudes and heterogeneity. This study introduces Matching-LLM, a weighted framework that combines LLM-generated responses with historical human behavioral data. Using the World Values Survey, American National Election Studies, and German election survey data, we evaluate its performance in reconstructing survey responses and predicting election outcomes. Results show that Matching-LLM generally improves accuracy relative to LLM-only, including 11 of 12 comparisons on survey questions excluded from calibration, although it does not consistently outperform History-only. In the 2024 U.S. presidential election, Matching-LLM predicts 310 Republican electoral votes, compared with the actual 312, outperforming both single-source benchmarks in electoral-vote accuracy. A supplementary German application extends the framework to a multiparty setting. Overall, the findings highlight the potential of historical data to improve LLM-based predictions while emphasizing the importance of task-specific validation.

econ.GN↗

Efficient Localization of Directional Emitters via Joint Beampattern Estimation

Localization methods designed for omnidirectional emitters degrade on directional sources, where directive beampatterns induce pronounced received signal strength (RSS) modulations. We present a direct position determination (DPD) approach that augments standard angle of arrival (AOA) and time difference of arrival (TDOA) measurements with RSS modulation to jointly estimate emitter position and beampattern parameters. Two algorithms reduce the four-dimensional search to two dimensions: a block coordinate ascent (BCA) method that alternates between position and beampattern subproblems, and a profile likelihood method that concentrates the beampattern parameters out via a generalized eigenvalue solve, a weighted least squares fit, and Newton refinement on the constrained Rayleigh quotient. We derive the Cramér--Rao lower bound (CRLB) and benchmark against an AOA-TDOA baseline and a prior-art approach that assumes known beamwidth and estimates only the orientation. The profile likelihood method approaches the CRLB, substantially outperforms all baselines at low signal-to-noise ratio (SNR), and remains robust under model mismatch with the assumed von Mises template. A sensitivity analysis shows performance peaks when receivers lie on the main-lobe edges where RSS gradients are maximized.

eess.SP↗

HateSense: Hierarchical Sentiment Analysis Framework for Hate Speech Detection: Implementing Binary and Multiclass Classification Strategy

Hate speech detectors must separate hateful posts from the far more common offensive but non-hateful ones, and two popular ideas for doing so are hierarchical (coarse-to-fine) classification and sentiment features. We revisit our earlier transformer-based framework, which combines both ideas, and test each component in a controlled study on two public benchmarks (Davidson et al., 24,783 tweets; HateXplain, 19,229 posts) with five random splits, validation-based tuning, and paired bootstrap tests. With linear models over word and character n-grams, the dominant-class-first hierarchy used in our framework lowered macro-F1 by 1.1-1.5 points relative to a flat classifier (p <= 0.007), and adding VADER sentiment features changed Davidson macro-F1 by at most 0.6 points, never significantly in the class-weighted settings. Class-weighted training was the only intervention with a large effect (+2.0 to +3.5 macro-F1 and +5.9 to +9.1 hate-class F1), and sentiment cannot separate the two abusive classes because hateful and offensive tweets are almost equally negative (mean VADER compound -0.35 vs. -0.29). Cross-dataset transfer cut macro-F1 to 43-53, and a reclaimed slur doubled the false hate rate of a logistic-regression detector, showing that in-domain scores overstate real-world reliability.

cs.CL↗

Polynomial and Hyperplane Avoidance over the Integers with Applications to Integer-Point Counting

We study the \emph{Polynomial Avoidance Problem}: given a finite collection $F \subseteq Z[x_1,\dots,x_n]$ of nonzero polynomials, find a vector $x \in Z^n$ of minimum $\ell_p$-norm such that $f(x)\neq0$ for every $f \in F$. Each polynomial is given sparsely as a list of its nonzero terms. The affine special case is the \emph{Hyperplane Avoidance Problem}. This special case arises in Barvinok-type algorithms for counting integer points in polyhedra, when certain rational generating functions must be evaluated at a removable singularity. Our main results are as follows: 1) Let $D:=\sum_{f\in F} \text{deg} f$. Every instance admits a feasible vector $x$ satisfying \[ \|x\|_1 \leq \min\left\{D,\frac{D+n}{2}\right\}. \] This bound is tight. Such a vector can be found by a deterministic algorithm whose bit complexity is polynomial in $D$ and the sparse encoding length of the input. Our proof uses a new algorithmic variant of the \emph{Combinatorial Nullstellensatz}; 2) In the affine case, with $m$ input polynomials, such a vector can be constructed by a fast deterministic polynomial-time algorithm using $O(nm)$ arithmetic operations. For the homogeneous case, Barvinok's original approach provides only the weaker guarantee $\|x\|_1 = O((nm)^{n-1})$; 3) The problem is NP-hard for every $p\in R_{\geq 1}\cup\{\infty\}$, even for homogeneous linear forms; 4) As an application, we improve the complexity bound for counting integer points in general rational polytopes. We also improve the bound for polyhedra of bounded codimension; this includes the counting version of the \emph{Unbounded Subset-Sum} problem as a special case.

cs.CC↗

Sharp Estimates for Jacobi Heat Kernels in Double Conic Domains

We study the even and odd Jacobi heat kernels defined in the context of the multidimensional double cone and its surface, the multidimensional hyperboloid and its surface, and the multidimensional paraboloid and its surface. By integrating the framework of Jacobi polynomials on these domains, as analyzed by Xu, with contemporary methods developed by Nowak, Sjögren, and Szarek for obtaining sharp estimates of the spherical heat kernel, we establish genuinely sharp estimates for the even and odd Jacobi heat kernel in the double conic settings, and for the even Jacobi heat kernel on hyperbolic settings. We also discuss the limitations encountered in extending these results to the remaining settings.

math.AP↗

The Price of Failure Risk: Clipped Barrier Policy Gradients with Convex Regularization

Many operations run on a budget that must rarely run out, such as a wear allowance. A wrapper keeps the remaining budget in the state, subtracts a barrier that grows as the budget shrinks and clips the combined reward from below at -m, and a standard policy-gradient learner trains unchanged. The clip level m is a price of failure risk, since the trained value splits exactly into utility before failure, the cost of a margin and the price times the risk, so whatever policy training returns earns the most such utility net of that cost among policies with no greater risk, up to its optimization error. Its risk exceeds a comparison policy's by at most order 1/m when charged costs stay bounded, and value or validation data certify it. The main theoretical result is exponential convergence of the population training flow under any parameter regularizer convex along the motions of the network's units and strong enough against the price, biased toward the prior policy. This extends mean-field convergence of policy gradients from relative entropy to weight decay, which covers continuous-time training of finite networks. Relative entropy adds noise that lets learning leave flat regions, weight decay pulls the parameters toward a reference, and action regularization bounds the risk change by the distance to a trusted rule. Experiments on an exact maintenance benchmark, a fuel-tank controller, a solvable flow and a benchmark-suite task measure the bounds' slack. We state when another method is better, without claiming this one outperforms them.

cs.LG↗

Smart Surveillance: Deep Learning and Hybrid Approaches for Dynamic Scene Analysis, Object Detection and Motion Tracking

Event-triggered recording reduces the footage a surveillance camera must store, but the trigger decides how much idle video is kept, how many events are missed, and how much computation is spent. We compare six motion triggers (frame differencing, dense optical flow, MOG2, KNN, CNT, GSOC), a CNN detector, strided detection, and three motion-gated hybrids under one recording policy, on a benchmark of seven static-camera scenes (5,800 frames, 27 annotated events) with thresholds transferred to unseen scenes by leave-one-video-out. Detector-based triggers stored 19-28% of idle frames, against 36-89% for motion triggers. Under simulated camera jitter, frame differencing, optical flow, MOG2 and KNN stored 97-100% of idle frames, while detector triggers stayed below 29%. Running the detector on every 8th frame kept 99.7% of event frames at 9.8 ms of CPU per frame, cheaper and more robust than gating it with background subtraction. On VisDrone, raising YOLO11n's input from 640 to 1280 px raised AP from 15.5 to 26.8, more than a larger model, and INT8 quantization cut latency by 17% for 0.3 AP. In tracking, longer track memory raised IDF1 from 70.5 to 76.7, but every tracker recovered only 39-44% of overlapped people, because detection rather than association failed.

cs.CV↗