Searcharxiv⌕ Search

arXiv subjects

Gitanjali Bhutani

Publications and source records attributed to Gitanjali Bhutani.

3 recordsLinked to original sources

Bootstrap-Conditioned Action Selection with Tabular Foundation Models

Contextual bandits offer a natural framework for sample-efficient personalization, but practical deployment remains difficult under sparse, biased interaction data, unreliable uncertainty estimates, and severe cold starts. We study whether pre-trained tabular foundation models with in-context learning can be turned into randomized policies for online decision making. We propose BC-ICL (Bootstrap-conditioned action selection using ICL), which at each round draws a bootstrap resample of the interaction history, conditions a frozen pre-trained ICL model on that resample, scores all actions, and selects the action with the highest sampled score. We further introduce an arm-context conditioning architecture that promotes shared statistical strength across actions and helps avoid common bootstrap failure modes of isolated-arm bandits. Empirically, this policy delivers strong early-round regret and regret performance on standard contextual bandit suites, outperforming established baselines under a strict online protocol.

cs.LG↗

A Round-based Pricing Scheme for Maximizing Service Provider's Revenue in P2PTV Networks

In this paper, we analyze a round-based pricing scheme that encourages favorable behavior from users of real-time P2P applications like P2PTV. In the design of pricing schemes, we consider price to be a function of usage and capacity of download/upload streams, and quality of content served. Users are consumers and servers at the same time in such networks, and often exhibit behavior that is unfavorable towards maximization of social benefits. Traditionally, network designers have overcome this difficulty by building-in traffic latencies. However, using simulations, we show that appropriate pricing schemes and usage terms can enable designers to limit required traffic latencies, and be able to earn nearly 30% extra revenue from providing P2PTV services. The service provider adjusts the prices of individual programs incrementally within rounds, while making relatively large-scale adjustments at the end of each round. Through simulations, we show that it is most beneficial for the service provider to carry out 5 such rounds of price adjustments for maximizing his average profit and minimizing the associated standard deviation at the same time.

cs.NI↗

A Near-Optimal Scheme for TCP ACK Pacing to Maintain Throughput in Wireless Networks

The advent of fourth generation technologies in wireless networks and the rapid growth of 3G have heralded an era that will require researchers to find reliable and easily implement-able solutions to the problem of poor TCP performance in the wireless environment. Since a large part of the Internet is TCP-based, solving this problem will be instrumental in determining if the move from wired to wireless will be seamless or not. This paper proposes a scheme that uses the base station's ability to predict the time at which the link may be going down and to estimate the period for which the mobile would be unreachable due to conditions like fading. By using cross-layer and ACK pacing algorithms, the base station prevents the fixed host from timing out while waiting for ACKs from the mobile. This in turn prevents TCP on the fixed host from bringing down the throughput drastically due to temporary network conditions, caused by mobility or the unreliability of wireless links. Experimental results indicate a reasonable increase in throughput when the ACK holding scheme is used.

cs.NI↗