Search arXiv⌕ Search

arXiv subjects

Junxuan Shen

Publications and source records attributed to Junxuan Shen.

4 recordsLinked to original sources

Sparse Predict and Demote: Optimal Scheduling with Minimal Size Advice

Knowledge of job sizes is crucial for optimizing the mean response time in single-server scheduling. However, predictions of job sizes are typically inexact and may be costly to obtain. Thus, a long-standing research question is: what is the minimal information about job sizes required to obtain near-optimal mean response time? We introduce a novel policy, \emph{Sparse Predict and Demote (SPD)}, and prove that it achieves order-optimal mean response time in heavy traffic while requiring only one-bit job-size predictions for a vanishing fraction of arrivals. SPD achieves heavy-traffic order-optimality even in situations when predictions are (i) inexact up to any fixed multiplicative error bound, and (ii) costly, i.e., the server is used to compute predictions and is thus unavailable to serve jobs while processing prediction queries. Finally, we use numerical experiments to illustrate that SPD maintains near-optimal performance beyond the heavy-traffic regime.

cs.PF↗

Robot Learning with Visual Predicted Force

Force-aware manipulation typically relies on specialized force or tactile sensors. We show that force-aware manipulation can instead be achieved through visual force prediction from the deformation of a compliant Fin Ray gripper. Our approach trains two models. First, we train a visual force estimator on calibration data and use it to annotate task demonstrations with force estimates. Second, we train an action--force proposal policy on these force-augmented demonstrations to jointly generate candidate robot actions and their associated forces. At test time, we sample candidate actions and the forces they are expected to produce, then execute the action whose predicted force is closest to a target from the demonstrations. We evaluate our approach on berry picking, empty-can grasping, in-hand reorientation, and plug insertion. Our results show that visual force prediction can guide inference-time action selection for contact-rich manipulation without requiring force or tactile sensors at deployment.

cs.RO↗

Structural Szemerédi-Trotter for Lattices and their Generalizations

We completely characterize point--line configurations with $Θ(n^{4/3})$ incidences when the point set is a section of the integer lattice. This can be seen as the main special case of the structural Szemerédi-Trotter problem. We also derive a partial characterization for several generalizations: (i) We rule out the concurrent lines case when the point set is a Cartesian product of an arithmetic progression and an arbitrary set. (ii) We study the case of a Cartesian product where one or both sets are generalized arithmetic progression. Our proofs rely on deriving properties of multiplicative energies.

math.CO↗

Optimal bounds for a Gaussian Arithmetic-Geometric type mean by quadratic and contraharmonic means

In this paper, we present the best possible parameters $α_i, β_i\ (i=1,2,3)$ and $α_4,β_4\in(1/2,1)$ such that the double inequalities \begin{align*} α_1Q(a,b)+(1-α_1)C(a,b)& 0$ with $a\neq b$, where $Q(a,b)$, $C(a,b)$ and $AG(a,b)$ are the quadratic, contraharmonic and Arithmetic-Geometric means, and $AG_{Q,C}(a,b)=AG[Q(a,b),C(a,b)]$. As consequences, we present new bounds for the complete elliptic integral of the first kind. Keywords: Arithmetic-Geometric mean, Complete elliptic integral, Quadratic mean, Contraharmonic mean

math.CA↗